./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.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 63d16a76c39be925680c9cc7e033d86fba83d57a1e8821aa7001ae36d8e5d8b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:22:26,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:22:27,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:22:27,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:22:27,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:22:27,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:22:27,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:22:27,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:22:27,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:22:27,100 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:22:27,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:22:27,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:22:27,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:22:27,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:22:27,103 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:22:27,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:22:27,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:22:27,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:22:27,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:22:27,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:22:27,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:22:27,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:22:27,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:22:27,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:22:27,111 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:22:27,118 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:22:27,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:22:27,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:22:27,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:22:27,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:22:27,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:22:27,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:22:27,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:22:27,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:22:27,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:22:27,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:22:27,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:22:27,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:22:27,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:22:27,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:22:27,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:22:27,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:22:27,126 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 -> 63d16a76c39be925680c9cc7e033d86fba83d57a1e8821aa7001ae36d8e5d8b8 [2024-11-16 15:22:27,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:22:27,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:22:27,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:22:27,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:22:27,434 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:22:27,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i [2024-11-16 15:22:29,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:22:29,270 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:22:29,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i [2024-11-16 15:22:29,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9219bf2c/ef274cc58a874fa193f2556fa7ca9d94/FLAG7929c7582 [2024-11-16 15:22:29,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9219bf2c/ef274cc58a874fa193f2556fa7ca9d94 [2024-11-16 15:22:29,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:22:29,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:22:29,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:22:29,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:22:29,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:22:29,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b61b7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29, skipping insertion in model container [2024-11-16 15:22:29,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:22:29,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i[918,931] [2024-11-16 15:22:29,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:22:29,646 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:22:29,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i[918,931] [2024-11-16 15:22:29,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:22:29,717 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:22:29,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29 WrapperNode [2024-11-16 15:22:29,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:22:29,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:22:29,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:22:29,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:22:29,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,795 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 267 [2024-11-16 15:22:29,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:22:29,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:22:29,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:22:29,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:22:29,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,846 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 15:22:29,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:22:29,868 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:22:29,868 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:22:29,868 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:22:29,869 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (1/1) ... [2024-11-16 15:22:29,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:22:29,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:22:29,908 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 15:22:29,915 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 15:22:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:22:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:22:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:22:29,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:22:29,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:22:29,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:22:30,074 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:22:30,077 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:22:30,569 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise25#1;havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~bitwise28#1;havoc property_#t~short29#1; [2024-11-16 15:22:30,631 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 15:22:30,631 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:22:30,659 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:22:30,662 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:22:30,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:22:30 BoogieIcfgContainer [2024-11-16 15:22:30,663 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:22:30,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:22:30,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:22:30,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:22:30,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:22:29" (1/3) ... [2024-11-16 15:22:30,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a042410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:22:30, skipping insertion in model container [2024-11-16 15:22:30,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:22:29" (2/3) ... [2024-11-16 15:22:30,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a042410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:22:30, skipping insertion in model container [2024-11-16 15:22:30,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:22:30" (3/3) ... [2024-11-16 15:22:30,676 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i [2024-11-16 15:22:30,698 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:22:30,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:22:30,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:22:30,795 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;@1ba98235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:22:30,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:22:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 86 states have internal predecessors, (123), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 15:22:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-16 15:22:30,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:30,821 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:30,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:30,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:30,830 INFO L85 PathProgramCache]: Analyzing trace with hash 309250394, now seen corresponding path program 1 times [2024-11-16 15:22:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:30,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680463768] [2024-11-16 15:22:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:31,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680463768] [2024-11-16 15:22:31,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680463768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:31,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:31,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:22:31,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515951967] [2024-11-16 15:22:31,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:31,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:22:31,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:31,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:22:31,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:22:31,588 INFO L87 Difference]: Start difference. First operand has 121 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 86 states have internal predecessors, (123), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 15:22:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:31,658 INFO L93 Difference]: Finished difference Result 227 states and 391 transitions. [2024-11-16 15:22:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:22:31,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 216 [2024-11-16 15:22:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:31,672 INFO L225 Difference]: With dead ends: 227 [2024-11-16 15:22:31,673 INFO L226 Difference]: Without dead ends: 109 [2024-11-16 15:22:31,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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 15:22:31,685 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:31,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:22:31,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-16 15:22:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-16 15:22:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 74 states have internal predecessors, (100), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 15:22:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 166 transitions. [2024-11-16 15:22:31,759 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 166 transitions. Word has length 216 [2024-11-16 15:22:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:31,759 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 166 transitions. [2024-11-16 15:22:31,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 15:22:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 166 transitions. [2024-11-16 15:22:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-16 15:22:31,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:31,769 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:31,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:22:31,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:31,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1946016737, now seen corresponding path program 1 times [2024-11-16 15:22:31,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:31,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639469629] [2024-11-16 15:22:31,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639469629] [2024-11-16 15:22:32,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639469629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:32,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:32,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:22:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287421352] [2024-11-16 15:22:32,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:32,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:22:32,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:32,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:22:32,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:22:32,216 INFO L87 Difference]: Start difference. First operand 109 states and 166 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:32,273 INFO L93 Difference]: Finished difference Result 216 states and 331 transitions. [2024-11-16 15:22:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:22:32,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2024-11-16 15:22:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:32,279 INFO L225 Difference]: With dead ends: 216 [2024-11-16 15:22:32,281 INFO L226 Difference]: Without dead ends: 110 [2024-11-16 15:22:32,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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 15:22:32,284 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:32,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:22:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-16 15:22:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-16 15:22:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 15:22:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 167 transitions. [2024-11-16 15:22:32,309 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 167 transitions. Word has length 216 [2024-11-16 15:22:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:32,313 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 167 transitions. [2024-11-16 15:22:32,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 167 transitions. [2024-11-16 15:22:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 15:22:32,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:32,321 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:32,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:22:32,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:32,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1107215485, now seen corresponding path program 1 times [2024-11-16 15:22:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:32,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83557852] [2024-11-16 15:22:32,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:33,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:33,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83557852] [2024-11-16 15:22:33,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83557852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:33,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:33,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:22:33,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316310596] [2024-11-16 15:22:33,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:33,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:22:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:33,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:22:33,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:22:33,407 INFO L87 Difference]: Start difference. First operand 110 states and 167 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 15:22:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:33,604 INFO L93 Difference]: Finished difference Result 292 states and 450 transitions. [2024-11-16 15:22:33,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:22:33,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 217 [2024-11-16 15:22:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:33,610 INFO L225 Difference]: With dead ends: 292 [2024-11-16 15:22:33,612 INFO L226 Difference]: Without dead ends: 185 [2024-11-16 15:22:33,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:22:33,615 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 100 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:33,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 287 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:22:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-16 15:22:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 175. [2024-11-16 15:22:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 106 states have internal predecessors, (136), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-16 15:22:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 268 transitions. [2024-11-16 15:22:33,682 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 268 transitions. Word has length 217 [2024-11-16 15:22:33,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:33,683 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 268 transitions. [2024-11-16 15:22:33,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-16 15:22:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 268 transitions. [2024-11-16 15:22:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-16 15:22:33,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:33,688 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:33,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:22:33,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:33,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1304562648, now seen corresponding path program 1 times [2024-11-16 15:22:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:33,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177408364] [2024-11-16 15:22:33,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:36,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:36,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177408364] [2024-11-16 15:22:36,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177408364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:36,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:36,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 15:22:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452587508] [2024-11-16 15:22:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:36,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 15:22:36,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:36,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 15:22:36,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:22:36,913 INFO L87 Difference]: Start difference. First operand 175 states and 268 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:38,107 INFO L93 Difference]: Finished difference Result 364 states and 548 transitions. [2024-11-16 15:22:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:22:38,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-16 15:22:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:38,111 INFO L225 Difference]: With dead ends: 364 [2024-11-16 15:22:38,111 INFO L226 Difference]: Without dead ends: 257 [2024-11-16 15:22:38,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:22:38,116 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 97 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:38,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 558 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 15:22:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-16 15:22:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 201. [2024-11-16 15:22:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 132 states have (on average 1.3333333333333333) internal successors, (176), 132 states have internal predecessors, (176), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-16 15:22:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 308 transitions. [2024-11-16 15:22:38,160 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 308 transitions. Word has length 218 [2024-11-16 15:22:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:38,161 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 308 transitions. [2024-11-16 15:22:38,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 308 transitions. [2024-11-16 15:22:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-16 15:22:38,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:38,166 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:38,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 15:22:38,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:38,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash 895738423, now seen corresponding path program 1 times [2024-11-16 15:22:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225753204] [2024-11-16 15:22:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:40,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:40,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225753204] [2024-11-16 15:22:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225753204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:40,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:40,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 15:22:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803698394] [2024-11-16 15:22:40,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:40,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 15:22:40,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:40,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 15:22:40,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:22:40,771 INFO L87 Difference]: Start difference. First operand 201 states and 308 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:42,018 INFO L93 Difference]: Finished difference Result 392 states and 590 transitions. [2024-11-16 15:22:42,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:22:42,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-16 15:22:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:42,022 INFO L225 Difference]: With dead ends: 392 [2024-11-16 15:22:42,022 INFO L226 Difference]: Without dead ends: 259 [2024-11-16 15:22:42,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 15:22:42,025 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 97 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:42,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1004 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 15:22:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-16 15:22:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 201. [2024-11-16 15:22:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 132 states have (on average 1.3333333333333333) internal successors, (176), 132 states have internal predecessors, (176), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-16 15:22:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 308 transitions. [2024-11-16 15:22:42,056 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 308 transitions. Word has length 218 [2024-11-16 15:22:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:42,057 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 308 transitions. [2024-11-16 15:22:42,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 308 transitions. [2024-11-16 15:22:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-16 15:22:42,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:42,061 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:42,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 15:22:42,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:42,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash -733493641, now seen corresponding path program 1 times [2024-11-16 15:22:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:42,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658721064] [2024-11-16 15:22:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:43,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:43,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658721064] [2024-11-16 15:22:43,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658721064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:43,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:43,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 15:22:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246659074] [2024-11-16 15:22:43,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:43,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 15:22:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 15:22:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:22:43,476 INFO L87 Difference]: Start difference. First operand 201 states and 308 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:44,198 INFO L93 Difference]: Finished difference Result 399 states and 607 transitions. [2024-11-16 15:22:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:22:44,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-16 15:22:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:44,201 INFO L225 Difference]: With dead ends: 399 [2024-11-16 15:22:44,202 INFO L226 Difference]: Without dead ends: 266 [2024-11-16 15:22:44,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:22:44,204 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 97 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:44,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 622 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 15:22:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-16 15:22:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 201. [2024-11-16 15:22:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 132 states have (on average 1.3333333333333333) internal successors, (176), 132 states have internal predecessors, (176), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-16 15:22:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 308 transitions. [2024-11-16 15:22:44,229 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 308 transitions. Word has length 218 [2024-11-16 15:22:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:44,231 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 308 transitions. [2024-11-16 15:22:44,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 308 transitions. [2024-11-16 15:22:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-16 15:22:44,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:44,236 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:44,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 15:22:44,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:44,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:44,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1142317866, now seen corresponding path program 1 times [2024-11-16 15:22:44,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:44,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236707909] [2024-11-16 15:22:44,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:44,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:45,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:45,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236707909] [2024-11-16 15:22:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236707909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:45,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:45,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 15:22:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832878966] [2024-11-16 15:22:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:45,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 15:22:45,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:45,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 15:22:45,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:22:45,293 INFO L87 Difference]: Start difference. First operand 201 states and 308 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:46,172 INFO L93 Difference]: Finished difference Result 394 states and 592 transitions. [2024-11-16 15:22:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:22:46,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-16 15:22:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:46,177 INFO L225 Difference]: With dead ends: 394 [2024-11-16 15:22:46,178 INFO L226 Difference]: Without dead ends: 261 [2024-11-16 15:22:46,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:22:46,179 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 97 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:46,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1128 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 15:22:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-16 15:22:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 177. [2024-11-16 15:22:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 108 states have internal predecessors, (138), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-16 15:22:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 270 transitions. [2024-11-16 15:22:46,209 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 270 transitions. Word has length 218 [2024-11-16 15:22:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:46,210 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 270 transitions. [2024-11-16 15:22:46,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 270 transitions. [2024-11-16 15:22:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-16 15:22:46,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:46,214 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:46,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 15:22:46,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:46,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:46,215 INFO L85 PathProgramCache]: Analyzing trace with hash -294322918, now seen corresponding path program 1 times [2024-11-16 15:22:46,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:46,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214393035] [2024-11-16 15:22:46,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:46,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:46,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:46,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214393035] [2024-11-16 15:22:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214393035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:46,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:46,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:22:46,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364514863] [2024-11-16 15:22:46,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:46,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:22:46,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:22:46,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:22:46,390 INFO L87 Difference]: Start difference. First operand 177 states and 270 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:46,461 INFO L93 Difference]: Finished difference Result 390 states and 595 transitions. [2024-11-16 15:22:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:22:46,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 220 [2024-11-16 15:22:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:46,465 INFO L225 Difference]: With dead ends: 390 [2024-11-16 15:22:46,466 INFO L226 Difference]: Without dead ends: 281 [2024-11-16 15:22:46,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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 15:22:46,468 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 147 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:46,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 291 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:22:46,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-16 15:22:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 203. [2024-11-16 15:22:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 134 states have (on average 1.3208955223880596) internal successors, (177), 134 states have internal predecessors, (177), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-16 15:22:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 309 transitions. [2024-11-16 15:22:46,502 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 309 transitions. Word has length 220 [2024-11-16 15:22:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:46,503 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 309 transitions. [2024-11-16 15:22:46,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 309 transitions. [2024-11-16 15:22:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-16 15:22:46,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:46,506 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:46,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 15:22:46,507 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:46,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:46,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1970451944, now seen corresponding path program 1 times [2024-11-16 15:22:46,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:46,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676074642] [2024-11-16 15:22:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:47,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676074642] [2024-11-16 15:22:47,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676074642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:47,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:47,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 15:22:47,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364802306] [2024-11-16 15:22:47,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:47,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 15:22:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 15:22:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:22:47,367 INFO L87 Difference]: Start difference. First operand 203 states and 309 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:47,943 INFO L93 Difference]: Finished difference Result 549 states and 805 transitions. [2024-11-16 15:22:47,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 15:22:47,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 220 [2024-11-16 15:22:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:47,946 INFO L225 Difference]: With dead ends: 549 [2024-11-16 15:22:47,947 INFO L226 Difference]: Without dead ends: 414 [2024-11-16 15:22:47,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 15:22:47,949 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 239 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:47,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 904 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:22:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-16 15:22:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 337. [2024-11-16 15:22:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 255 states have internal predecessors, (340), 79 states have call successors, (79), 4 states have call predecessors, (79), 4 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-16 15:22:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 498 transitions. [2024-11-16 15:22:47,979 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 498 transitions. Word has length 220 [2024-11-16 15:22:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:47,979 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 498 transitions. [2024-11-16 15:22:47,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 498 transitions. [2024-11-16 15:22:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-16 15:22:47,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:47,982 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:47,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 15:22:47,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:47,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash 134835299, now seen corresponding path program 1 times [2024-11-16 15:22:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:47,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562176248] [2024-11-16 15:22:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-16 15:22:48,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562176248] [2024-11-16 15:22:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562176248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:22:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480721703] [2024-11-16 15:22:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:48,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:22:48,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:22:48,403 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 15:22:48,404 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 15:22:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:48,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 15:22:48,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:22:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 480 proven. 96 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2024-11-16 15:22:49,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:22:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-16 15:22:49,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480721703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:22:49,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 15:22:49,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-16 15:22:49,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273444603] [2024-11-16 15:22:49,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 15:22:49,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 15:22:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:49,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 15:22:49,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:22:49,510 INFO L87 Difference]: Start difference. First operand 337 states and 498 transitions. Second operand has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 6 states have call successors, (97), 3 states have call predecessors, (97), 5 states have return successors, (98), 5 states have call predecessors, (98), 6 states have call successors, (98) [2024-11-16 15:22:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:49,811 INFO L93 Difference]: Finished difference Result 638 states and 917 transitions. [2024-11-16 15:22:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 15:22:49,813 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 6 states have call successors, (97), 3 states have call predecessors, (97), 5 states have return successors, (98), 5 states have call predecessors, (98), 6 states have call successors, (98) Word has length 220 [2024-11-16 15:22:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:49,817 INFO L225 Difference]: With dead ends: 638 [2024-11-16 15:22:49,817 INFO L226 Difference]: Without dead ends: 369 [2024-11-16 15:22:49,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-16 15:22:49,818 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 257 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:49,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 262 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:22:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-16 15:22:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 365. [2024-11-16 15:22:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 274 states have (on average 1.302919708029197) internal successors, (357), 276 states have internal predecessors, (357), 79 states have call successors, (79), 11 states have call predecessors, (79), 11 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-16 15:22:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 515 transitions. [2024-11-16 15:22:49,851 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 515 transitions. Word has length 220 [2024-11-16 15:22:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:49,852 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 515 transitions. [2024-11-16 15:22:49,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 6 states have call successors, (97), 3 states have call predecessors, (97), 5 states have return successors, (98), 5 states have call predecessors, (98), 6 states have call successors, (98) [2024-11-16 15:22:49,852 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 515 transitions. [2024-11-16 15:22:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-16 15:22:49,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:49,856 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:49,876 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 15:22:50,056 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 15:22:50,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:50,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:50,057 INFO L85 PathProgramCache]: Analyzing trace with hash -709636572, now seen corresponding path program 1 times [2024-11-16 15:22:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:50,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333174921] [2024-11-16 15:22:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:50,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:22:50,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901846647] [2024-11-16 15:22:50,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:50,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:22:50,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:22:50,166 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 15:22:50,168 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 15:22:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:50,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 15:22:50,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:22:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 488 proven. 84 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-16 15:22:50,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:22:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 12 proven. 84 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-16 15:22:51,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:51,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333174921] [2024-11-16 15:22:51,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 15:22:51,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901846647] [2024-11-16 15:22:51,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901846647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:22:51,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 15:22:51,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-16 15:22:51,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812441558] [2024-11-16 15:22:51,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 15:22:51,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 15:22:51,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:51,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 15:22:51,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-16 15:22:51,084 INFO L87 Difference]: Start difference. First operand 365 states and 515 transitions. Second operand has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) [2024-11-16 15:22:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:52,269 INFO L93 Difference]: Finished difference Result 812 states and 1096 transitions. [2024-11-16 15:22:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 15:22:52,270 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) Word has length 220 [2024-11-16 15:22:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:52,274 INFO L225 Difference]: With dead ends: 812 [2024-11-16 15:22:52,274 INFO L226 Difference]: Without dead ends: 523 [2024-11-16 15:22:52,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-16 15:22:52,276 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 161 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:52,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1052 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 15:22:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-16 15:22:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 356. [2024-11-16 15:22:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 266 states have (on average 1.2894736842105263) internal successors, (343), 267 states have internal predecessors, (343), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-16 15:22:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2024-11-16 15:22:52,306 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 220 [2024-11-16 15:22:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:52,306 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2024-11-16 15:22:52,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) [2024-11-16 15:22:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2024-11-16 15:22:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-16 15:22:52,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:52,309 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:52,327 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 15:22:52,513 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,SelfDestructingSolverStorable10 [2024-11-16 15:22:52,514 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:52,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash 286459063, now seen corresponding path program 1 times [2024-11-16 15:22:52,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:52,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063288616] [2024-11-16 15:22:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:52,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:53,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:53,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063288616] [2024-11-16 15:22:53,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063288616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:53,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:53,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 15:22:53,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717866368] [2024-11-16 15:22:53,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:53,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 15:22:53,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:53,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 15:22:53,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:22:53,017 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:53,664 INFO L93 Difference]: Finished difference Result 895 states and 1224 transitions. [2024-11-16 15:22:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:22:53,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 220 [2024-11-16 15:22:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:53,668 INFO L225 Difference]: With dead ends: 895 [2024-11-16 15:22:53,670 INFO L226 Difference]: Without dead ends: 619 [2024-11-16 15:22:53,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:22:53,673 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 178 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:53,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 913 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 15:22:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-16 15:22:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 363. [2024-11-16 15:22:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 273 states have (on average 1.293040293040293) internal successors, (353), 274 states have internal predecessors, (353), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-16 15:22:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 507 transitions. [2024-11-16 15:22:53,711 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 507 transitions. Word has length 220 [2024-11-16 15:22:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:53,711 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 507 transitions. [2024-11-16 15:22:53,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 507 transitions. [2024-11-16 15:22:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-16 15:22:53,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:53,715 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:53,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 15:22:53,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:53,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1723307435, now seen corresponding path program 1 times [2024-11-16 15:22:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:53,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359213061] [2024-11-16 15:22:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:22:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:22:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:22:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:22:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:22:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:22:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:22:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:22:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:22:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:22:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:22:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:22:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:22:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:22:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:22:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:22:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:22:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:22:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:22:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:22:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:22:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:22:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:22:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:22:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 15:22:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 15:22:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 15:22:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 15:22:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 15:22:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-16 15:22:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 15:22:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 15:22:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 15:22:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:22:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:22:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:22:53,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359213061] [2024-11-16 15:22:53,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359213061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:22:53,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:22:53,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:22:53,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505168585] [2024-11-16 15:22:53,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:22:53,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:22:53,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:22:53,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:22:53,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:22:53,876 INFO L87 Difference]: Start difference. First operand 363 states and 507 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:22:53,969 INFO L93 Difference]: Finished difference Result 731 states and 1015 transitions. [2024-11-16 15:22:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:22:53,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 221 [2024-11-16 15:22:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:22:53,973 INFO L225 Difference]: With dead ends: 731 [2024-11-16 15:22:53,974 INFO L226 Difference]: Without dead ends: 448 [2024-11-16 15:22:53,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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 15:22:53,976 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 29 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:22:53,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 287 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:22:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-16 15:22:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 381. [2024-11-16 15:22:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 291 states have (on average 1.2920962199312716) internal successors, (376), 292 states have internal predecessors, (376), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-16 15:22:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 530 transitions. [2024-11-16 15:22:54,010 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 530 transitions. Word has length 221 [2024-11-16 15:22:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:22:54,011 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 530 transitions. [2024-11-16 15:22:54,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:22:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 530 transitions. [2024-11-16 15:22:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-16 15:22:54,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:22:54,014 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:22:54,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 15:22:54,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:22:54,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:22:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 775673385, now seen corresponding path program 1 times [2024-11-16 15:22:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:22:54,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435151576] [2024-11-16 15:22:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:22:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:22:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790141418] [2024-11-16 15:22:54,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:22:54,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:22:54,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:22:54,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:22:54,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 15:22:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:22:54,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:22:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:22:54,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:22:54,750 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:22:54,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:22:54,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 15:22:54,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:22:54,957 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:22:55,097 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:22:55,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:22:55 BoogieIcfgContainer [2024-11-16 15:22:55,100 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:22:55,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:22:55,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:22:55,101 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:22:55,101 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:22:30" (3/4) ... [2024-11-16 15:22:55,104 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:22:55,105 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:22:55,105 INFO L158 Benchmark]: Toolchain (without parser) took 25788.35ms. Allocated memory was 180.4MB in the beginning and 408.9MB in the end (delta: 228.6MB). Free memory was 124.3MB in the beginning and 183.2MB in the end (delta: -58.8MB). Peak memory consumption was 170.2MB. Max. memory is 16.1GB. [2024-11-16 15:22:55,105 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 180.4MB. Free memory was 146.3MB in the beginning and 146.0MB in the end (delta: 318.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:22:55,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.07ms. Allocated memory is still 180.4MB. Free memory was 123.9MB in the beginning and 106.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 15:22:55,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.55ms. Allocated memory is still 180.4MB. Free memory was 106.7MB in the beginning and 102.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:22:55,106 INFO L158 Benchmark]: Boogie Preprocessor took 70.74ms. Allocated memory is still 180.4MB. Free memory was 102.5MB in the beginning and 98.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:22:55,106 INFO L158 Benchmark]: IcfgBuilder took 794.98ms. Allocated memory is still 180.4MB. Free memory was 98.8MB in the beginning and 66.9MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 15:22:55,106 INFO L158 Benchmark]: TraceAbstraction took 24434.66ms. Allocated memory was 180.4MB in the beginning and 408.9MB in the end (delta: 228.6MB). Free memory was 66.5MB in the beginning and 183.2MB in the end (delta: -116.7MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. [2024-11-16 15:22:55,107 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 408.9MB. Free memory is still 183.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:22:55,108 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.28ms. Allocated memory is still 180.4MB. Free memory was 146.3MB in the beginning and 146.0MB in the end (delta: 318.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.07ms. Allocated memory is still 180.4MB. Free memory was 123.9MB in the beginning and 106.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.55ms. Allocated memory is still 180.4MB. Free memory was 106.7MB in the beginning and 102.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.74ms. Allocated memory is still 180.4MB. Free memory was 102.5MB in the beginning and 98.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 794.98ms. Allocated memory is still 180.4MB. Free memory was 98.8MB in the beginning and 66.9MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24434.66ms. Allocated memory was 180.4MB in the beginning and 408.9MB in the end (delta: 228.6MB). Free memory was 66.5MB in the beginning and 183.2MB in the end (delta: -116.7MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 408.9MB. Free memory is still 183.2MB. 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 someBinaryFLOATComparisonOperation at line 186, overapproximation of shiftLeft at line 197, overapproximation of someUnaryDOUBLEoperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 197. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_23 = 64; [L40] unsigned char var_1_24 = 64; [L41] unsigned char var_1_25 = 2; [L42] unsigned short int var_1_26 = 32; [L43] unsigned long int var_1_27 = 100; [L44] unsigned short int var_1_28 = 64; [L45] float var_1_30 = -0.2; [L46] float var_1_32 = -0.375; [L47] float var_1_33 = 1.4; [L48] float var_1_34 = 200.4; [L49] float var_1_35 = 1.5; [L50] unsigned char var_1_36 = 0; [L51] unsigned char last_1_var_1_10 = 32; [L52] unsigned short int last_1_var_1_12 = 16; [L53] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L192] last_1_var_1_10 = var_1_10 [L193] last_1_var_1_12 = var_1_12 [L194] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_short() [L141] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L141] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L143] var_1_5 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L146] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L146] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L147] var_1_6 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L150] var_1_7 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L151] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L152] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L152] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L153] var_1_8 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0, var_1_9=9/5] [L154] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0, var_1_9=9/5] [L155] var_1_9 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L156] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L157] var_1_11 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L158] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L159] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L160] var_1_15 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L161] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L162] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L163] var_1_20 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L165] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L165] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L166] var_1_21 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L167] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L168] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L168] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L169] var_1_24 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L170] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L171] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L171] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L172] var_1_25 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L173] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L174] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L175] var_1_27 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L176] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L177] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L178] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L178] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L179] var_1_30 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L180] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L181] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L181] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L182] var_1_32 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L183] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L184] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L184] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L185] var_1_34 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L186] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L187] var_1_36 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L188] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L189] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L205] RET updateVariables() [L206] CALL step() [L57] COND TRUE var_1_20 || var_1_21 [L58] var_1_19 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L60] COND FALSE !(((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L65] COND TRUE var_1_12 <= var_1_12 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L66] COND TRUE var_1_12 <= (((((var_1_25) < (var_1_24)) ? (var_1_25) : (var_1_24))) / var_1_27) [L67] var_1_26 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L80] COND FALSE !((var_1_1 / var_1_30) > ((((var_1_1 / var_1_32) < 0 ) ? -(var_1_1 / var_1_32) : (var_1_1 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L85] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L86] COND TRUE ((256 - var_1_25) <= (var_1_13 + var_1_16)) || var_1_20 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L87] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L93] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L94] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L96] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L97] COND TRUE var_1_6 <= stepLocal_2 [L98] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L102] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L102] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L109] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L111] var_1_18 = var_1_3 [L112] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L113] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=256, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L114] COND FALSE !((- var_1_9) <= var_1_8) [L127] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L129] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L130] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L130] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L131] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L197] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L197] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L197] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L197] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L197-L198] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=-256, var_1_16=8, var_1_18=0, var_1_19=256, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=32, var_1_25=254, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=9, var_1_6=8, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.2s, OverallIterations: 14, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1505 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1499 mSDsluCounter, 7782 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5620 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3728 IncrementalHoareTripleChecker+Invalid, 3849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 2162 mSDtfsCounter, 3728 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1817 GetRequests, 1730 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=13, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 922 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 3724 NumberOfCodeBlocks, 3724 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3486 ConstructedInterpolants, 0 QuantifiedInterpolants, 10564 SizeOfPredicates, 9 NumberOfNonLiveVariables, 974 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 33336/33792 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 15:22:55,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.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 63d16a76c39be925680c9cc7e033d86fba83d57a1e8821aa7001ae36d8e5d8b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:22:57,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:22:57,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:22:57,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:22:57,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:22:57,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:22:57,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:22:57,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:22:57,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:22:57,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:22:57,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:22:57,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:22:57,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:22:57,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:22:57,634 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:22:57,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:22:57,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:22:57,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:22:57,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:22:57,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:22:57,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:22:57,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:22:57,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:22:57,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:22:57,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:22:57,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:22:57,641 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:22:57,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:22:57,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:22:57,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:22:57,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:22:57,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:22:57,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:22:57,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:22:57,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:22:57,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:22:57,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:22:57,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:22:57,644 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:22:57,644 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:22:57,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:22:57,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:22:57,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:22:57,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:22:57,647 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 -> 63d16a76c39be925680c9cc7e033d86fba83d57a1e8821aa7001ae36d8e5d8b8 [2024-11-16 15:22:57,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:22:58,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:22:58,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:22:58,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:22:58,024 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:22:58,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i [2024-11-16 15:22:59,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:22:59,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:22:59,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i [2024-11-16 15:22:59,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95812c3b/f23d1ae4e7d544da94e3d730be0eac04/FLAG52dd98f41 [2024-11-16 15:23:00,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95812c3b/f23d1ae4e7d544da94e3d730be0eac04 [2024-11-16 15:23:00,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:23:00,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:23:00,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:23:00,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:23:00,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:23:00,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b97bfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00, skipping insertion in model container [2024-11-16 15:23:00,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:23:00,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i[918,931] [2024-11-16 15:23:00,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:23:00,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:23:00,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i[918,931] [2024-11-16 15:23:00,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:23:00,470 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:23:00,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00 WrapperNode [2024-11-16 15:23:00,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:23:00,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:23:00,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:23:00,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:23:00,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,527 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-16 15:23:00,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:23:00,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:23:00,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:23:00,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:23:00,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,583 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 15:23:00,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:23:00,613 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:23:00,613 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:23:00,613 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:23:00,614 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (1/1) ... [2024-11-16 15:23:00,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:23:00,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:23:00,658 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 15:23:00,661 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 15:23:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:23:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:23:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:23:00,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:23:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:23:00,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:23:00,806 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:23:00,809 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:23:11,143 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 15:23:11,144 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:23:11,162 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:23:11,163 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:23:11,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:23:11 BoogieIcfgContainer [2024-11-16 15:23:11,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:23:11,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:23:11,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:23:11,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:23:11,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:23:00" (1/3) ... [2024-11-16 15:23:11,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190ead44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:23:11, skipping insertion in model container [2024-11-16 15:23:11,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:23:00" (2/3) ... [2024-11-16 15:23:11,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190ead44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:23:11, skipping insertion in model container [2024-11-16 15:23:11,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:23:11" (3/3) ... [2024-11-16 15:23:11,172 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-9.i [2024-11-16 15:23:11,191 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:23:11,191 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:23:11,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:23:11,265 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;@2042ac4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:23:11,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:23:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 15:23:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-16 15:23:11,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:23:11,285 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:23:11,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:23:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:23:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1613529229, now seen corresponding path program 1 times [2024-11-16 15:23:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:23:11,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150929511] [2024-11-16 15:23:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:23:11,304 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 15:23:11,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:23:11,308 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 15:23:11,330 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 15:23:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:23:13,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:23:13,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:23:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-16 15:23:13,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:23:13,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:23:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150929511] [2024-11-16 15:23:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150929511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:23:13,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:23:13,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:23:13,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687564145] [2024-11-16 15:23:13,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:23:13,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:23:13,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:23:13,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:23:13,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:23:13,206 INFO L87 Difference]: Start difference. First operand has 98 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:23:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:23:13,238 INFO L93 Difference]: Finished difference Result 185 states and 330 transitions. [2024-11-16 15:23:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:23:13,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-16 15:23:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:23:13,249 INFO L225 Difference]: With dead ends: 185 [2024-11-16 15:23:13,249 INFO L226 Difference]: Without dead ends: 90 [2024-11-16 15:23:13,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 207 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 15:23:13,261 INFO L432 NwaCegarLoop]: 138 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, 138 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 15:23:13,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:23:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-16 15:23:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-16 15:23:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 15:23:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2024-11-16 15:23:13,336 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 138 transitions. Word has length 208 [2024-11-16 15:23:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:23:13,336 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-11-16 15:23:13,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-16 15:23:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 138 transitions. [2024-11-16 15:23:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-16 15:23:13,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:23:13,345 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:23:13,397 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 15:23:13,545 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 15:23:13,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:23:13,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:23:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash -840003763, now seen corresponding path program 1 times [2024-11-16 15:23:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:23:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13715794] [2024-11-16 15:23:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:23:13,553 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 15:23:13,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:23:13,556 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 15:23:13,557 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 15:23:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:23:15,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 15:23:15,150 INFO L278 TraceCheckSpWp]: Computing forward predicates...