./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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_variablewrapping_wrapper-s_file-83.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 e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:11:21,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:11:21,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:11:21,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:11:21,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:11:21,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:11:21,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:11:21,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:11:21,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:11:21,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:11:21,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:11:21,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:11:21,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:11:21,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:11:21,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:11:21,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:11:21,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:11:21,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:11:21,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:11:21,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:11:21,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:11:21,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:11:21,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:11:21,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:11:21,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:11:21,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:11:21,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:11:21,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:11:21,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:11:21,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:11:21,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:11:21,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:11:21,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:11:21,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:11:21,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:11:21,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:11:21,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:11:21,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:11:21,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:11:21,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:11:21,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:11:21,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:11:21,582 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 -> e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 [2024-11-22 13:11:21,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:11:21,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:11:21,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:11:21,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:11:21,840 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:11:21,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-11-22 13:11:23,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:11:23,549 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:11:23,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-11-22 13:11:23,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7f87ead/db2717ee400b4ed58ea46bef4af08f9d/FLAG724099308 [2024-11-22 13:11:23,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7f87ead/db2717ee400b4ed58ea46bef4af08f9d [2024-11-22 13:11:23,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:11:23,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:11:23,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:11:23,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:11:23,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:11:23,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:11:23" (1/1) ... [2024-11-22 13:11:23,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c17c254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:23, skipping insertion in model container [2024-11-22 13:11:23,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:11:23" (1/1) ... [2024-11-22 13:11:23,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:11:24,176 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_variablewrapping_wrapper-s_file-83.i[916,929] [2024-11-22 13:11:24,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:11:24,243 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:11:24,253 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_variablewrapping_wrapper-s_file-83.i[916,929] [2024-11-22 13:11:24,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:11:24,312 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:11:24,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24 WrapperNode [2024-11-22 13:11:24,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:11:24,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:11:24,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:11:24,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:11:24,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,395 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2024-11-22 13:11:24,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:11:24,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:11:24,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:11:24,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:11:24,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,424 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-22 13:11:24,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:11:24,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:11:24,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:11:24,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:11:24,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (1/1) ... [2024-11-22 13:11:24,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:11:24,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:11:24,526 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-22 13:11:24,530 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-22 13:11:24,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:11:24,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-22 13:11:24,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-22 13:11:24,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-22 13:11:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-22 13:11:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-22 13:11:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-22 13:11:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:11:24,583 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:11:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 13:11:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:11:24,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:11:24,711 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:11:24,713 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:11:25,324 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-11-22 13:11:25,324 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:11:25,343 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:11:25,344 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:11:25,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:11:25 BoogieIcfgContainer [2024-11-22 13:11:25,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:11:25,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:11:25,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:11:25,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:11:25,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:11:23" (1/3) ... [2024-11-22 13:11:25,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485d5f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:11:25, skipping insertion in model container [2024-11-22 13:11:25,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:24" (2/3) ... [2024-11-22 13:11:25,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485d5f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:11:25, skipping insertion in model container [2024-11-22 13:11:25,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:11:25" (3/3) ... [2024-11-22 13:11:25,356 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-83.i [2024-11-22 13:11:25,370 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:11:25,370 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:11:25,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:11:25,443 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;@145692ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:11:25,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:11:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.469387755102041) internal successors, (144), 99 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:11:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 13:11:25,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:25,465 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:25,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:25,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1804544545, now seen corresponding path program 1 times [2024-11-22 13:11:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751446688] [2024-11-22 13:11:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:25,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751446688] [2024-11-22 13:11:26,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751446688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:26,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:11:26,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193716308] [2024-11-22 13:11:26,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:26,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:11:26,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:11:26,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:11:26,338 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.469387755102041) internal successors, (144), 99 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:26,434 INFO L93 Difference]: Finished difference Result 220 states and 341 transitions. [2024-11-22 13:11:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:11:26,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-22 13:11:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:26,448 INFO L225 Difference]: With dead ends: 220 [2024-11-22 13:11:26,448 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 13:11:26,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:11:26,456 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:26,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:11:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 13:11:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-22 13:11:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:11:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-11-22 13:11:26,515 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 106 [2024-11-22 13:11:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:26,517 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-11-22 13:11:26,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-11-22 13:11:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 13:11:26,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:26,523 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:26,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:11:26,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:26,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:26,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1810364381, now seen corresponding path program 1 times [2024-11-22 13:11:26,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:26,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713188436] [2024-11-22 13:11:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:26,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:26,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713188436] [2024-11-22 13:11:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713188436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:26,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:11:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703473081] [2024-11-22 13:11:26,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:26,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:11:26,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:26,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:11:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:11:26,831 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:26,875 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-11-22 13:11:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:11:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-22 13:11:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:26,878 INFO L225 Difference]: With dead ends: 220 [2024-11-22 13:11:26,878 INFO L226 Difference]: Without dead ends: 113 [2024-11-22 13:11:26,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:11:26,883 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:26,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:11:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-22 13:11:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-22 13:11:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:11:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-11-22 13:11:26,904 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 106 [2024-11-22 13:11:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:26,905 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-11-22 13:11:26,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-11-22 13:11:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 13:11:26,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:26,907 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:26,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:11:26,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:26,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash -35357019, now seen corresponding path program 1 times [2024-11-22 13:11:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61107225] [2024-11-22 13:11:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:26,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:27,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:27,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61107225] [2024-11-22 13:11:27,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61107225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:27,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:27,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:11:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373658633] [2024-11-22 13:11:27,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:27,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:11:27,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:27,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:11:27,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:11:27,145 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:27,174 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2024-11-22 13:11:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:11:27,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-22 13:11:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:27,179 INFO L225 Difference]: With dead ends: 224 [2024-11-22 13:11:27,180 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 13:11:27,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:11:27,182 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:27,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:11:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 13:11:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-22 13:11:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:11:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-22 13:11:27,193 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 106 [2024-11-22 13:11:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:27,194 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-22 13:11:27,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-22 13:11:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 13:11:27,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:27,197 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:27,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:11:27,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:27,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash -33509977, now seen corresponding path program 1 times [2024-11-22 13:11:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:27,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301667732] [2024-11-22 13:11:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:27,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:27,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:27,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301667732] [2024-11-22 13:11:27,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301667732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:27,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:27,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:11:27,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050201963] [2024-11-22 13:11:27,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:27,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:11:27,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:27,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:11:27,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:11:27,663 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:27,884 INFO L93 Difference]: Finished difference Result 225 states and 315 transitions. [2024-11-22 13:11:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:11:27,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-22 13:11:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:27,887 INFO L225 Difference]: With dead ends: 225 [2024-11-22 13:11:27,888 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 13:11:27,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:11:27,890 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 138 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:27,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 153 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:11:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 13:11:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-22 13:11:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:11:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2024-11-22 13:11:27,906 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 106 [2024-11-22 13:11:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:27,906 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2024-11-22 13:11:27,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2024-11-22 13:11:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-22 13:11:27,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:27,908 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:27,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:11:27,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:27,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash 895739275, now seen corresponding path program 1 times [2024-11-22 13:11:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:27,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632923264] [2024-11-22 13:11:27,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:28,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:28,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632923264] [2024-11-22 13:11:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632923264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:28,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:11:28,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454979636] [2024-11-22 13:11:28,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:28,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:11:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:28,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:11:28,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:11:28,166 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:28,465 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2024-11-22 13:11:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:11:28,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-22 13:11:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:28,468 INFO L225 Difference]: With dead ends: 227 [2024-11-22 13:11:28,469 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 13:11:28,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:11:28,472 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:28,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 437 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:11:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 13:11:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-22 13:11:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:11:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2024-11-22 13:11:28,485 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 107 [2024-11-22 13:11:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:28,486 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2024-11-22 13:11:28,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2024-11-22 13:11:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 13:11:28,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:28,489 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:28,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:11:28,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:28,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash 85606593, now seen corresponding path program 1 times [2024-11-22 13:11:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:28,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442117099] [2024-11-22 13:11:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:30,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442117099] [2024-11-22 13:11:30,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442117099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:30,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:11:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621365310] [2024-11-22 13:11:30,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:30,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:11:30,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:30,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:11:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:11:30,160 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:11:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:30,828 INFO L93 Difference]: Finished difference Result 310 states and 426 transitions. [2024-11-22 13:11:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:11:30,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-22 13:11:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:30,831 INFO L225 Difference]: With dead ends: 310 [2024-11-22 13:11:30,831 INFO L226 Difference]: Without dead ends: 197 [2024-11-22 13:11:30,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:11:30,832 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 83 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:30,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 707 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 13:11:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-22 13:11:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2024-11-22 13:11:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 176 states have (on average 1.3409090909090908) internal successors, (236), 177 states have internal predecessors, (236), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 13:11:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 266 transitions. [2024-11-22 13:11:30,848 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 266 transitions. Word has length 108 [2024-11-22 13:11:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:30,848 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 266 transitions. [2024-11-22 13:11:30,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:11:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 266 transitions. [2024-11-22 13:11:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 13:11:30,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:30,852 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:30,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:11:30,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:30,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash -935461761, now seen corresponding path program 1 times [2024-11-22 13:11:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:30,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552236796] [2024-11-22 13:11:30,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:30,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:11:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867248290] [2024-11-22 13:11:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:31,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:31,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:11:31,027 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-22 13:11:31,029 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-22 13:11:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:31,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 13:11:31,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:11:31,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:11:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:31,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:11:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:31,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552236796] [2024-11-22 13:11:31,598 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 13:11:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867248290] [2024-11-22 13:11:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867248290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:31,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:11:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497720023] [2024-11-22 13:11:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:31,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:11:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:31,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:11:31,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:11:31,601 INFO L87 Difference]: Start difference. First operand 194 states and 266 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:32,078 INFO L93 Difference]: Finished difference Result 548 states and 754 transitions. [2024-11-22 13:11:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:11:32,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-22 13:11:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:32,083 INFO L225 Difference]: With dead ends: 548 [2024-11-22 13:11:32,083 INFO L226 Difference]: Without dead ends: 357 [2024-11-22 13:11:32,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:11:32,085 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 113 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:32,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 451 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:11:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-22 13:11:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 214. [2024-11-22 13:11:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 196 states have (on average 1.3571428571428572) internal successors, (266), 197 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 13:11:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 296 transitions. [2024-11-22 13:11:32,117 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 296 transitions. Word has length 108 [2024-11-22 13:11:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:32,118 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 296 transitions. [2024-11-22 13:11:32,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 296 transitions. [2024-11-22 13:11:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 13:11:32,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:32,121 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:32,134 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-22 13:11:32,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:32,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:32,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:32,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1771157633, now seen corresponding path program 1 times [2024-11-22 13:11:32,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:32,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663721333] [2024-11-22 13:11:32,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:32,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:11:32,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081352753] [2024-11-22 13:11:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:32,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:32,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:11:32,453 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-22 13:11:32,455 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-22 13:11:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:32,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 13:11:32,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:11:32,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:32,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-11-22 13:11:33,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:33,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 12 [2024-11-22 13:11:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:33,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:11:33,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:33,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663721333] [2024-11-22 13:11:33,123 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 13:11:33,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081352753] [2024-11-22 13:11:33,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081352753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:33,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:33,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:11:33,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829488786] [2024-11-22 13:11:33,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:33,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:11:33,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:33,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:11:33,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:11:33,126 INFO L87 Difference]: Start difference. First operand 214 states and 296 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:34,369 INFO L93 Difference]: Finished difference Result 606 states and 838 transitions. [2024-11-22 13:11:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:11:34,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-22 13:11:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:34,372 INFO L225 Difference]: With dead ends: 606 [2024-11-22 13:11:34,372 INFO L226 Difference]: Without dead ends: 395 [2024-11-22 13:11:34,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:11:34,374 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 297 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:34,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 510 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 13:11:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-22 13:11:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 221. [2024-11-22 13:11:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 204 states have internal predecessors, (274), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 13:11:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 304 transitions. [2024-11-22 13:11:34,394 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 304 transitions. Word has length 108 [2024-11-22 13:11:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:34,395 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 304 transitions. [2024-11-22 13:11:34,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 304 transitions. [2024-11-22 13:11:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 13:11:34,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:34,398 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:34,410 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-22 13:11:34,598 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,SelfDestructingSolverStorable7 [2024-11-22 13:11:34,599 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:34,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1718407104, now seen corresponding path program 1 times [2024-11-22 13:11:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:34,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097853634] [2024-11-22 13:11:34,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097853634] [2024-11-22 13:11:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097853634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:35,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:35,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:11:35,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211474998] [2024-11-22 13:11:35,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:35,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:11:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:11:35,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:11:35,114 INFO L87 Difference]: Start difference. First operand 221 states and 304 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 13:11:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:35,468 INFO L93 Difference]: Finished difference Result 439 states and 605 transitions. [2024-11-22 13:11:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:11:35,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2024-11-22 13:11:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:35,471 INFO L225 Difference]: With dead ends: 439 [2024-11-22 13:11:35,471 INFO L226 Difference]: Without dead ends: 221 [2024-11-22 13:11:35,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:11:35,472 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 225 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:35,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 203 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:11:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-22 13:11:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-11-22 13:11:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 203 states have (on average 1.3399014778325122) internal successors, (272), 204 states have internal predecessors, (272), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 13:11:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 302 transitions. [2024-11-22 13:11:35,488 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 302 transitions. Word has length 108 [2024-11-22 13:11:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:35,489 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 302 transitions. [2024-11-22 13:11:35,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 13:11:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 302 transitions. [2024-11-22 13:11:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 13:11:35,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:35,491 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:35,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 13:11:35,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:35,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1137606269, now seen corresponding path program 1 times [2024-11-22 13:11:35,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:35,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664399306] [2024-11-22 13:11:35,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:35,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:37,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664399306] [2024-11-22 13:11:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664399306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:37,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:37,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:11:37,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228780398] [2024-11-22 13:11:37,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:37,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:11:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:37,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:11:37,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:11:37,136 INFO L87 Difference]: Start difference. First operand 221 states and 302 transitions. Second operand has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 13:11:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:38,439 INFO L93 Difference]: Finished difference Result 529 states and 724 transitions. [2024-11-22 13:11:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:11:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2024-11-22 13:11:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:38,441 INFO L225 Difference]: With dead ends: 529 [2024-11-22 13:11:38,442 INFO L226 Difference]: Without dead ends: 311 [2024-11-22 13:11:38,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:11:38,443 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 97 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:38,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 777 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 13:11:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-22 13:11:38,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 236. [2024-11-22 13:11:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 218 states have (on average 1.348623853211009) internal successors, (294), 219 states have internal predecessors, (294), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 13:11:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 324 transitions. [2024-11-22 13:11:38,464 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 324 transitions. Word has length 108 [2024-11-22 13:11:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:38,465 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 324 transitions. [2024-11-22 13:11:38,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 13:11:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 324 transitions. [2024-11-22 13:11:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 13:11:38,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:38,467 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:38,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 13:11:38,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:38,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:38,468 INFO L85 PathProgramCache]: Analyzing trace with hash -626011005, now seen corresponding path program 1 times [2024-11-22 13:11:38,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:38,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915433703] [2024-11-22 13:11:38,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:38,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:39,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915433703] [2024-11-22 13:11:39,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915433703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:39,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:39,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:11:39,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665528602] [2024-11-22 13:11:39,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:39,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:11:39,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:39,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:11:39,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:11:40,000 INFO L87 Difference]: Start difference. First operand 236 states and 324 transitions. Second operand has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 13:11:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:41,573 INFO L93 Difference]: Finished difference Result 557 states and 767 transitions. [2024-11-22 13:11:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:11:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2024-11-22 13:11:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:41,577 INFO L225 Difference]: With dead ends: 557 [2024-11-22 13:11:41,577 INFO L226 Difference]: Without dead ends: 324 [2024-11-22 13:11:41,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:11:41,579 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 95 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:41,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 928 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 13:11:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-22 13:11:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 266. [2024-11-22 13:11:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 248 states have (on average 1.3588709677419355) internal successors, (337), 249 states have internal predecessors, (337), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 13:11:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 367 transitions. [2024-11-22 13:11:41,601 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 367 transitions. Word has length 108 [2024-11-22 13:11:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:41,602 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 367 transitions. [2024-11-22 13:11:41,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 13:11:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 367 transitions. [2024-11-22 13:11:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 13:11:41,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:41,603 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:41,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 13:11:41,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:41,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1647079359, now seen corresponding path program 1 times [2024-11-22 13:11:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:41,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282185139] [2024-11-22 13:11:41,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:42,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:42,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282185139] [2024-11-22 13:11:42,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282185139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:42,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:42,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:11:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18400449] [2024-11-22 13:11:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:42,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:11:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:42,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:11:42,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:11:42,431 INFO L87 Difference]: Start difference. First operand 266 states and 367 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:11:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:43,005 INFO L93 Difference]: Finished difference Result 601 states and 827 transitions. [2024-11-22 13:11:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:11:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-22 13:11:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:43,008 INFO L225 Difference]: With dead ends: 601 [2024-11-22 13:11:43,009 INFO L226 Difference]: Without dead ends: 338 [2024-11-22 13:11:43,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:11:43,011 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 77 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:43,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1052 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:11:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-22 13:11:43,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 335. [2024-11-22 13:11:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 314 states have (on average 1.356687898089172) internal successors, (426), 316 states have internal predecessors, (426), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 13:11:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 460 transitions. [2024-11-22 13:11:43,031 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 460 transitions. Word has length 108 [2024-11-22 13:11:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:43,031 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 460 transitions. [2024-11-22 13:11:43,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:11:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 460 transitions. [2024-11-22 13:11:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 13:11:43,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:43,033 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:43,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 13:11:43,034 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash 234761414, now seen corresponding path program 1 times [2024-11-22 13:11:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:43,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8870010] [2024-11-22 13:11:43,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:11:43,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066109505] [2024-11-22 13:11:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:43,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:43,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:11:43,115 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-22 13:11:43,117 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-22 13:11:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:43,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 13:11:43,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:11:43,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-22 13:11:43,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:43,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2024-11-22 13:11:43,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:43,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 64 [2024-11-22 13:11:43,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:43,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 22 [2024-11-22 13:11:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:43,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:11:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8870010] [2024-11-22 13:11:43,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 13:11:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066109505] [2024-11-22 13:11:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066109505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:43,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:43,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:11:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212758201] [2024-11-22 13:11:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:43,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:11:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:43,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:11:43,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:11:43,876 INFO L87 Difference]: Start difference. First operand 335 states and 460 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:44,709 INFO L93 Difference]: Finished difference Result 777 states and 1064 transitions. [2024-11-22 13:11:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 13:11:44,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-22 13:11:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:44,714 INFO L225 Difference]: With dead ends: 777 [2024-11-22 13:11:44,715 INFO L226 Difference]: Without dead ends: 445 [2024-11-22 13:11:44,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:11:44,716 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 386 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:44,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 570 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 13:11:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-22 13:11:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 438. [2024-11-22 13:11:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 404 states have (on average 1.3465346534653466) internal successors, (544), 408 states have internal predecessors, (544), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 13:11:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 600 transitions. [2024-11-22 13:11:44,761 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 600 transitions. Word has length 109 [2024-11-22 13:11:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:44,762 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 600 transitions. [2024-11-22 13:11:44,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 600 transitions. [2024-11-22 13:11:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 13:11:44,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:44,764 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:44,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 13:11:44,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:44,965 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:44,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:44,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1353586488, now seen corresponding path program 1 times [2024-11-22 13:11:44,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:44,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443425828] [2024-11-22 13:11:44,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:44,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:11:45,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115948734] [2024-11-22 13:11:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:45,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:45,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:11:45,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:11:45,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 13:11:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:45,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-22 13:11:45,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:11:45,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2024-11-22 13:11:45,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 100 [2024-11-22 13:11:45,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 13:11:45,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-22 13:11:46,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:46,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 45 [2024-11-22 13:11:46,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:46,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 48 [2024-11-22 13:11:46,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:46,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 17 [2024-11-22 13:11:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:46,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:11:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443425828] [2024-11-22 13:11:46,454 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 13:11:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115948734] [2024-11-22 13:11:46,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115948734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:46,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:46,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:11:46,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991849031] [2024-11-22 13:11:46,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:46,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:11:46,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:46,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:11:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:11:46,456 INFO L87 Difference]: Start difference. First operand 438 states and 600 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:50,684 INFO L93 Difference]: Finished difference Result 1328 states and 1809 transitions. [2024-11-22 13:11:50,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 13:11:50,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-22 13:11:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:50,690 INFO L225 Difference]: With dead ends: 1328 [2024-11-22 13:11:50,690 INFO L226 Difference]: Without dead ends: 921 [2024-11-22 13:11:50,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:11:50,692 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 342 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:50,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 725 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-22 13:11:50,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-22 13:11:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 491. [2024-11-22 13:11:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 454 states have (on average 1.3458149779735682) internal successors, (611), 457 states have internal predecessors, (611), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 13:11:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 671 transitions. [2024-11-22 13:11:50,724 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 671 transitions. Word has length 109 [2024-11-22 13:11:50,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:50,728 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 671 transitions. [2024-11-22 13:11:50,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 671 transitions. [2024-11-22 13:11:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 13:11:50,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:50,730 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:50,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 13:11:50,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:50,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:50,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1652934134, now seen corresponding path program 1 times [2024-11-22 13:11:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:50,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632914408] [2024-11-22 13:11:50,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:11:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957646666] [2024-11-22 13:11:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:51,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:51,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:11:51,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:11:51,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 13:11:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:51,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 13:11:51,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:11:51,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:51,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2024-11-22 13:11:51,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:51,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 19 [2024-11-22 13:11:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:51,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:11:51,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:51,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632914408] [2024-11-22 13:11:51,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 13:11:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957646666] [2024-11-22 13:11:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957646666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:51,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:11:51,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138748749] [2024-11-22 13:11:51,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:11:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:51,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:11:51,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:11:51,726 INFO L87 Difference]: Start difference. First operand 491 states and 671 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:52,750 INFO L93 Difference]: Finished difference Result 1113 states and 1506 transitions. [2024-11-22 13:11:52,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:11:52,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-22 13:11:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:52,754 INFO L225 Difference]: With dead ends: 1113 [2024-11-22 13:11:52,754 INFO L226 Difference]: Without dead ends: 700 [2024-11-22 13:11:52,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:11:52,756 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 201 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:52,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 927 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 13:11:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-22 13:11:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 686. [2024-11-22 13:11:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 630 states have (on average 1.33015873015873) internal successors, (838), 636 states have internal predecessors, (838), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-22 13:11:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 928 transitions. [2024-11-22 13:11:52,799 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 928 transitions. Word has length 109 [2024-11-22 13:11:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:52,799 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 928 transitions. [2024-11-22 13:11:52,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 928 transitions. [2024-11-22 13:11:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 13:11:52,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:52,801 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:52,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 13:11:53,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-22 13:11:53,006 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:53,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:53,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1630301880, now seen corresponding path program 1 times [2024-11-22 13:11:53,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:53,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813038517] [2024-11-22 13:11:53,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:53,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:11:53,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817493215] [2024-11-22 13:11:53,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:53,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:53,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:11:53,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:11:53,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 13:11:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:53,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 13:11:53,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:11:53,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 13:11:53,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-22 13:11:53,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:53,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2024-11-22 13:11:53,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:53,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 53 [2024-11-22 13:11:53,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:53,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 22 [2024-11-22 13:11:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:11:53,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:11:53,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:53,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813038517] [2024-11-22 13:11:53,619 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 13:11:53,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817493215] [2024-11-22 13:11:53,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817493215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:11:53,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:11:53,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:11:53,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111079456] [2024-11-22 13:11:53,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:11:53,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:11:53,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:11:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:11:53,621 INFO L87 Difference]: Start difference. First operand 686 states and 928 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:54,355 INFO L93 Difference]: Finished difference Result 1287 states and 1735 transitions. [2024-11-22 13:11:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:11:54,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-22 13:11:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:54,360 INFO L225 Difference]: With dead ends: 1287 [2024-11-22 13:11:54,360 INFO L226 Difference]: Without dead ends: 686 [2024-11-22 13:11:54,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:11:54,362 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 307 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:54,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 649 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 13:11:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-22 13:11:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 662. [2024-11-22 13:11:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 606 states have (on average 1.3201320132013201) internal successors, (800), 612 states have internal predecessors, (800), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-22 13:11:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 890 transitions. [2024-11-22 13:11:54,411 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 890 transitions. Word has length 109 [2024-11-22 13:11:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:54,413 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 890 transitions. [2024-11-22 13:11:54,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:11:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 890 transitions. [2024-11-22 13:11:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-22 13:11:54,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:54,415 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:54,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-22 13:11:54,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-22 13:11:54,616 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:54,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1637408930, now seen corresponding path program 1 times [2024-11-22 13:11:54,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950903555] [2024-11-22 13:11:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:54,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:11:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640152473] [2024-11-22 13:11:54,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:54,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:54,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:11:54,717 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:11:54,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 13:11:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:55,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-22 13:11:55,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:11:55,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2024-11-22 13:11:55,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2024-11-22 13:11:55,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:11:55,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-22 13:11:55,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-22 13:11:55,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-22 13:11:55,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:55,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2024-11-22 13:11:55,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:55,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 40 [2024-11-22 13:11:56,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:56,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2024-11-22 13:11:56,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:56,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 31 [2024-11-22 13:11:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 118 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-22 13:11:56,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:11:57,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:11:57,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950903555] [2024-11-22 13:11:57,245 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 13:11:57,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640152473] [2024-11-22 13:11:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640152473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:11:57,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:11:57,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-22 13:11:57,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667195108] [2024-11-22 13:11:57,246 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 13:11:57,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 13:11:57,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:11:57,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 13:11:57,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:11:57,247 INFO L87 Difference]: Start difference. First operand 662 states and 890 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 13:11:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:11:58,808 INFO L93 Difference]: Finished difference Result 1712 states and 2291 transitions. [2024-11-22 13:11:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 13:11:58,808 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 110 [2024-11-22 13:11:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:11:58,813 INFO L225 Difference]: With dead ends: 1712 [2024-11-22 13:11:58,813 INFO L226 Difference]: Without dead ends: 1135 [2024-11-22 13:11:58,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2024-11-22 13:11:58,816 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 414 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:11:58,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 916 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 13:11:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-22 13:11:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 671. [2024-11-22 13:11:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 613 states have (on average 1.3164763458401305) internal successors, (807), 619 states have internal predecessors, (807), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-22 13:11:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 897 transitions. [2024-11-22 13:11:58,856 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 897 transitions. Word has length 110 [2024-11-22 13:11:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:11:58,857 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 897 transitions. [2024-11-22 13:11:58,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 13:11:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 897 transitions. [2024-11-22 13:11:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-22 13:11:58,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:11:58,858 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:11:58,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-22 13:11:59,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:59,059 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:11:59,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:11:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1613857758, now seen corresponding path program 1 times [2024-11-22 13:11:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:11:59,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083775679] [2024-11-22 13:11:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:11:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:11:59,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531054382] [2024-11-22 13:11:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:11:59,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:11:59,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:11:59,156 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:11:59,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 13:11:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:11:59,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-22 13:11:59,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:11:59,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:11:59,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:11:59,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:11:59,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:11:59,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:11:59,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2024-11-22 13:11:59,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:59,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 54 [2024-11-22 13:11:59,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:11:59,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 57 [2024-11-22 13:12:00,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:12:00,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 31 [2024-11-22 13:12:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:12:00,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:00,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:00,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083775679] [2024-11-22 13:12:00,155 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 13:12:00,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531054382] [2024-11-22 13:12:00,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531054382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:00,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:00,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:12:00,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264107646] [2024-11-22 13:12:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:00,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:12:00,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:12:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:12:00,157 INFO L87 Difference]: Start difference. First operand 671 states and 897 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:03,457 INFO L93 Difference]: Finished difference Result 1251 states and 1673 transitions. [2024-11-22 13:12:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:12:03,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-22 13:12:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:03,461 INFO L225 Difference]: With dead ends: 1251 [2024-11-22 13:12:03,461 INFO L226 Difference]: Without dead ends: 674 [2024-11-22 13:12:03,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:12:03,463 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 193 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:03,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 440 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-22 13:12:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-22 13:12:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 672. [2024-11-22 13:12:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 614 states have (on average 1.3159609120521172) internal successors, (808), 620 states have internal predecessors, (808), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-22 13:12:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 898 transitions. [2024-11-22 13:12:03,508 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 898 transitions. Word has length 110 [2024-11-22 13:12:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:03,510 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 898 transitions. [2024-11-22 13:12:03,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 898 transitions. [2024-11-22 13:12:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-22 13:12:03,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:03,512 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:03,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 13:12:03,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-22 13:12:03,715 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:03,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:03,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1679660447, now seen corresponding path program 1 times [2024-11-22 13:12:03,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:03,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558378191] [2024-11-22 13:12:03,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:03,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:12:03,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:03,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558378191] [2024-11-22 13:12:03,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558378191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:03,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:03,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:12:03,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427842010] [2024-11-22 13:12:03,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:03,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:12:03,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:03,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:12:03,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:12:03,950 INFO L87 Difference]: Start difference. First operand 672 states and 898 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:04,529 INFO L93 Difference]: Finished difference Result 1470 states and 1966 transitions. [2024-11-22 13:12:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:12:04,530 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-22 13:12:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:04,534 INFO L225 Difference]: With dead ends: 1470 [2024-11-22 13:12:04,535 INFO L226 Difference]: Without dead ends: 892 [2024-11-22 13:12:04,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:12:04,537 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 114 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:04,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 579 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:12:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-11-22 13:12:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 732. [2024-11-22 13:12:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 674 states have (on average 1.3130563798219586) internal successors, (885), 680 states have internal predecessors, (885), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-22 13:12:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 975 transitions. [2024-11-22 13:12:04,594 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 975 transitions. Word has length 110 [2024-11-22 13:12:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:04,594 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 975 transitions. [2024-11-22 13:12:04,595 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 975 transitions. [2024-11-22 13:12:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-22 13:12:04,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:04,596 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:04,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 13:12:04,597 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:04,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:04,597 INFO L85 PathProgramCache]: Analyzing trace with hash 868132520, now seen corresponding path program 1 times [2024-11-22 13:12:04,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:04,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454711026] [2024-11-22 13:12:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:04,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:12:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454711026] [2024-11-22 13:12:05,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454711026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105082507] [2024-11-22 13:12:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:05,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:12:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:05,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:12:05,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:05,315 INFO L87 Difference]: Start difference. First operand 732 states and 975 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:12:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:05,731 INFO L93 Difference]: Finished difference Result 1306 states and 1748 transitions. [2024-11-22 13:12:05,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:12:05,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-22 13:12:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:05,735 INFO L225 Difference]: With dead ends: 1306 [2024-11-22 13:12:05,735 INFO L226 Difference]: Without dead ends: 662 [2024-11-22 13:12:05,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:12:05,737 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:05,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 509 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:12:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-22 13:12:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2024-11-22 13:12:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 602 states have (on average 1.3073089700996678) internal successors, (787), 608 states have internal predecessors, (787), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-22 13:12:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 877 transitions. [2024-11-22 13:12:05,790 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 877 transitions. Word has length 110 [2024-11-22 13:12:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:05,790 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 877 transitions. [2024-11-22 13:12:05,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:12:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 877 transitions. [2024-11-22 13:12:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 13:12:05,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:05,792 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:05,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 13:12:05,793 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:05,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:05,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1363964450, now seen corresponding path program 1 times [2024-11-22 13:12:05,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:05,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561488651] [2024-11-22 13:12:05,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:05,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:12:06,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:06,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561488651] [2024-11-22 13:12:06,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561488651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:06,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:06,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:06,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577814858] [2024-11-22 13:12:06,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:06,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:12:06,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:06,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:12:06,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:06,538 INFO L87 Difference]: Start difference. First operand 660 states and 877 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:12:07,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:07,069 INFO L93 Difference]: Finished difference Result 1228 states and 1633 transitions. [2024-11-22 13:12:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:12:07,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-22 13:12:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:07,072 INFO L225 Difference]: With dead ends: 1228 [2024-11-22 13:12:07,072 INFO L226 Difference]: Without dead ends: 656 [2024-11-22 13:12:07,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:12:07,074 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 66 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:07,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 627 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:12:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-22 13:12:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 654. [2024-11-22 13:12:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 596 states have (on average 1.3020134228187918) internal successors, (776), 602 states have internal predecessors, (776), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-22 13:12:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 866 transitions. [2024-11-22 13:12:07,116 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 866 transitions. Word has length 111 [2024-11-22 13:12:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:07,117 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 866 transitions. [2024-11-22 13:12:07,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:12:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 866 transitions. [2024-11-22 13:12:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 13:12:07,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:07,118 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:07,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 13:12:07,119 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:07,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:07,119 INFO L85 PathProgramCache]: Analyzing trace with hash 555859810, now seen corresponding path program 1 times [2024-11-22 13:12:07,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:07,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060265576] [2024-11-22 13:12:07,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:07,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:12:07,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340993980] [2024-11-22 13:12:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:12:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:12:07,187 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:12:07,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 13:12:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:12:07,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:12:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:12:08,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:12:08,269 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:12:08,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 13:12:08,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 13:12:08,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:12:08,475 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:12:08,528 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:12:08,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:12:08 BoogieIcfgContainer [2024-11-22 13:12:08,530 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:12:08,531 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:12:08,531 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:12:08,531 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:12:08,532 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:11:25" (3/4) ... [2024-11-22 13:12:08,534 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 13:12:08,535 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:12:08,535 INFO L158 Benchmark]: Toolchain (without parser) took 44616.94ms. Allocated memory was 157.3MB in the beginning and 520.1MB in the end (delta: 362.8MB). Free memory was 96.6MB in the beginning and 320.7MB in the end (delta: -224.2MB). Peak memory consumption was 137.7MB. Max. memory is 16.1GB. [2024-11-22 13:12:08,535 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:12:08,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.09ms. Allocated memory is still 157.3MB. Free memory was 96.6MB in the beginning and 115.7MB in the end (delta: -19.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 13:12:08,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.91ms. Allocated memory is still 157.3MB. Free memory was 115.7MB in the beginning and 110.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:12:08,536 INFO L158 Benchmark]: Boogie Preprocessor took 81.64ms. Allocated memory is still 157.3MB. Free memory was 110.9MB in the beginning and 106.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:12:08,536 INFO L158 Benchmark]: RCFGBuilder took 867.14ms. Allocated memory is still 157.3MB. Free memory was 106.7MB in the beginning and 69.6MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-22 13:12:08,536 INFO L158 Benchmark]: TraceAbstraction took 43183.02ms. Allocated memory was 157.3MB in the beginning and 520.1MB in the end (delta: 362.8MB). Free memory was 69.0MB in the beginning and 320.7MB in the end (delta: -251.8MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2024-11-22 13:12:08,537 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 520.1MB. Free memory is still 320.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:12:08,538 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.19ms. Allocated memory is still 100.7MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.09ms. Allocated memory is still 157.3MB. Free memory was 96.6MB in the beginning and 115.7MB in the end (delta: -19.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.91ms. Allocated memory is still 157.3MB. Free memory was 115.7MB in the beginning and 110.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.64ms. Allocated memory is still 157.3MB. Free memory was 110.9MB in the beginning and 106.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 867.14ms. Allocated memory is still 157.3MB. Free memory was 106.7MB in the beginning and 69.6MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 43183.02ms. Allocated memory was 157.3MB in the beginning and 520.1MB in the end (delta: 362.8MB). Free memory was 69.0MB in the beginning and 320.7MB in the end (delta: -251.8MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 520.1MB. Free memory is still 320.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of bitwiseOr at line 69. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L51] unsigned short int last_1_WrapperStruct00_var_1_1 = 128; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_1=128] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] EXPR WrapperStruct00.var_1_1 [L103] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L84] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L94] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_10 [L95] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_10 [L95] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L96] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_11 [L97] EXPR WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_11 [L97] EXPR WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] EXPR (WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L98] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L99] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L114] RET updateVariables() [L115] CALL step() [L55] WrapperStruct00.var_1_14 = 200 [L56] EXPR WrapperStruct00.var_1_16 [L56] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L57] EXPR WrapperStruct00.var_1_10 [L57] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_10 [L58] EXPR WrapperStruct00.var_1_3 [L58] EXPR WrapperStruct00.var_1_4 [L58] signed long int stepLocal_0 = WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4; [L59] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_0=12] [L59] COND FALSE !(WrapperStruct00.var_1_2) [L62] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_0=12] [L62] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_0=12] [L62] COND TRUE stepLocal_0 >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)))) [L63] EXPR WrapperStruct00.var_1_4 [L63] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_4 [L68] EXPR WrapperStruct00.var_1_3 [L68] EXPR WrapperStruct00.var_1_1 [L68] signed long int stepLocal_2 = WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1; [L69] EXPR WrapperStruct00.var_1_14 [L69] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_2=27] [L69] EXPR WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_2=27] [L69] signed long int stepLocal_1 = WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15; [L70] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_1=1, stepLocal_2=27] [L70] COND FALSE !(WrapperStruct00.var_1_15 <= stepLocal_2) [L77] EXPR WrapperStruct00.var_1_10 [L77] WrapperStruct00.var_1_8 = WrapperStruct00.var_1_10 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_1=1] [L79] COND FALSE !(WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3))) [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)) [L106] EXPR WrapperStruct00.var_1_1 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR ((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10))) [L106] EXPR WrapperStruct00.var_1_15 [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)) [L106] EXPR WrapperStruct00.var_1_8 [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR (WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_17 == ((double) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106-L107] return (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_17 == ((double) WrapperStruct00.var_1_10)) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.1s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3225 SdHoareTripleChecker+Valid, 18.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3217 mSDsluCounter, 12481 SdHoareTripleChecker+Invalid, 16.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9420 mSDsCounter, 327 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9245 IncrementalHoareTripleChecker+Invalid, 9572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 327 mSolverCounterUnsat, 3061 mSDtfsCounter, 9245 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1085 GetRequests, 933 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=732occurred in iteration=19, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 1564 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 3368 NumberOfCodeBlocks, 3368 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2253 ConstructedInterpolants, 13 QuantifiedInterpolants, 10359 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3332 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 4608/4620 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-22 13:12:08,702 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/current/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_variablewrapping_wrapper-s_file-83.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 e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:12:10,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:12:10,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 13:12:10,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:12:10,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:12:10,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:12:10,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:12:10,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:12:10,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:12:10,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:12:10,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:12:10,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:12:10,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:12:10,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:12:10,946 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:12:10,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:12:10,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:12:10,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:12:10,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:12:10,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:12:10,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:12:10,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:12:10,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:12:10,956 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 13:12:10,956 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 13:12:10,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:12:10,956 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 13:12:10,957 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:12:10,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:12:10,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:12:10,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:12:10,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:12:10,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:12:10,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:12:10,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:12:10,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:12:10,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:12:10,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:12:10,959 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 13:12:10,959 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 13:12:10,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:12:10,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:12:10,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:12:10,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:12:10,962 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 -> e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 [2024-11-22 13:12:11,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:12:11,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:12:11,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:12:11,316 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:12:11,317 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:12:11,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-11-22 13:12:12,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:12:13,067 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:12:13,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-11-22 13:12:13,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8eb7a442/f6361a3568f448bda3ba3f402118b9ae/FLAG5b0b13b43 [2024-11-22 13:12:13,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8eb7a442/f6361a3568f448bda3ba3f402118b9ae [2024-11-22 13:12:13,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:12:13,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:12:13,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:12:13,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:12:13,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:12:13,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8bd6e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13, skipping insertion in model container [2024-11-22 13:12:13,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:12:13,325 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_variablewrapping_wrapper-s_file-83.i[916,929] [2024-11-22 13:12:13,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:12:13,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:12:13,456 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_variablewrapping_wrapper-s_file-83.i[916,929] [2024-11-22 13:12:13,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:12:13,533 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:12:13,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13 WrapperNode [2024-11-22 13:12:13,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:12:13,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:12:13,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:12:13,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:12:13,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,619 INFO L138 Inliner]: procedures = 34, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2024-11-22 13:12:13,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:12:13,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:12:13,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:12:13,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:12:13,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,680 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-22 13:12:13,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:12:13,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:12:13,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:12:13,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:12:13,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (1/1) ... [2024-11-22 13:12:13,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:12:13,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:12:13,780 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-22 13:12:13,794 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-22 13:12:13,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:12:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 13:12:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 13:12:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-22 13:12:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-22 13:12:13,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 13:12:13,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 13:12:13,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 13:12:13,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 13:12:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 13:12:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 13:12:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 13:12:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 13:12:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-22 13:12:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-22 13:12:13,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-22 13:12:13,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-22 13:12:13,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:12:13,831 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:12:13,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:12:13,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:12:13,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 13:12:13,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 13:12:13,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 13:12:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 13:12:13,953 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:12:13,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:12:15,444 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-22 13:12:15,445 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:12:15,465 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:12:15,466 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:12:15,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:12:15 BoogieIcfgContainer [2024-11-22 13:12:15,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:12:15,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:12:15,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:12:15,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:12:15,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:12:13" (1/3) ... [2024-11-22 13:12:15,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d1b2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:12:15, skipping insertion in model container [2024-11-22 13:12:15,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:13" (2/3) ... [2024-11-22 13:12:15,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d1b2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:12:15, skipping insertion in model container [2024-11-22 13:12:15,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:12:15" (3/3) ... [2024-11-22 13:12:15,491 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-83.i [2024-11-22 13:12:15,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:12:15,507 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:12:15,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:12:15,587 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;@1831e482, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:12:15,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:12:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 89 states have (on average 1.449438202247191) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:12:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 13:12:15,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:15,606 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:15,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:15,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1933956208, now seen corresponding path program 1 times [2024-11-22 13:12:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:12:15,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534374950] [2024-11-22 13:12:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:15,633 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-22 13:12:15,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:12:15,636 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-22 13:12:15,638 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-22 13:12:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:16,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:12:16,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-22 13:12:16,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:16,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:12:16,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534374950] [2024-11-22 13:12:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534374950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:16,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:16,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:12:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401240276] [2024-11-22 13:12:16,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:16,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:12:16,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:12:16,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:12:16,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:12:16,110 INFO L87 Difference]: Start difference. First operand has 103 states, 89 states have (on average 1.449438202247191) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:12:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:16,150 INFO L93 Difference]: Finished difference Result 199 states and 307 transitions. [2024-11-22 13:12:16,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:12:16,153 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-11-22 13:12:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:16,163 INFO L225 Difference]: With dead ends: 199 [2024-11-22 13:12:16,163 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 13:12:16,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-22 13:12:16,173 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-22 13:12:16,175 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-22 13:12:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 13:12:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-22 13:12:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:12:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-11-22 13:12:16,225 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 104 [2024-11-22 13:12:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:16,225 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-11-22 13:12:16,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:12:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-11-22 13:12:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 13:12:16,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:16,228 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:16,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 13:12:16,430 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-22 13:12:16,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:16,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:16,432 INFO L85 PathProgramCache]: Analyzing trace with hash 679711970, now seen corresponding path program 1 times [2024-11-22 13:12:16,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:12:16,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890895419] [2024-11-22 13:12:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:16,433 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-22 13:12:16,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:12:16,436 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-22 13:12:16,438 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-22 13:12:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:16,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 13:12:16,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-22 13:12:16,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:16,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:12:16,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890895419] [2024-11-22 13:12:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890895419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:16,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:16,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:12:16,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535092064] [2024-11-22 13:12:16,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:16,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:12:16,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:12:16,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:12:16,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:16,833 INFO L87 Difference]: Start difference. First operand 99 states and 138 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:12:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:16,940 INFO L93 Difference]: Finished difference Result 197 states and 276 transitions. [2024-11-22 13:12:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:12:16,944 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-11-22 13:12:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:16,946 INFO L225 Difference]: With dead ends: 197 [2024-11-22 13:12:16,946 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 13:12:16,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:16,948 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:16,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:12:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 13:12:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-22 13:12:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:12:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2024-11-22 13:12:16,968 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 104 [2024-11-22 13:12:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:16,970 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2024-11-22 13:12:16,970 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 13:12:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2024-11-22 13:12:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 13:12:16,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:16,972 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:16,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 13:12:17,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:12:17,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:17,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1259450076, now seen corresponding path program 1 times [2024-11-22 13:12:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:12:17,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327727353] [2024-11-22 13:12:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:17,178 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-22 13:12:17,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:12:17,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:12:17,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 13:12:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:17,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:12:17,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:12:17,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:17,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:12:17,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327727353] [2024-11-22 13:12:17,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327727353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:17,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:17,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:12:17,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025671428] [2024-11-22 13:12:17,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:17,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:12:17,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:12:17,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:12:17,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:12:17,554 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:17,627 INFO L93 Difference]: Finished difference Result 204 states and 284 transitions. [2024-11-22 13:12:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:12:17,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-22 13:12:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:17,632 INFO L225 Difference]: With dead ends: 204 [2024-11-22 13:12:17,632 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 13:12:17,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:12:17,635 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:17,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 516 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 13:12:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-22 13:12:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:12:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2024-11-22 13:12:17,653 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 104 [2024-11-22 13:12:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:17,653 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2024-11-22 13:12:17,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2024-11-22 13:12:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 13:12:17,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:17,659 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:17,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 13:12:17,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:12:17,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:17,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash -579391706, now seen corresponding path program 1 times [2024-11-22 13:12:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:12:17,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434429510] [2024-11-22 13:12:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:17,862 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-22 13:12:17,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:12:17,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:12:17,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 13:12:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:18,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:12:18,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:12:18,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:18,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:12:18,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434429510] [2024-11-22 13:12:18,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434429510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:18,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:18,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989098667] [2024-11-22 13:12:18,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:18,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:12:18,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:12:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:12:18,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:18,239 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:18,321 INFO L93 Difference]: Finished difference Result 210 states and 289 transitions. [2024-11-22 13:12:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:12:18,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-22 13:12:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:18,323 INFO L225 Difference]: With dead ends: 210 [2024-11-22 13:12:18,323 INFO L226 Difference]: Without dead ends: 108 [2024-11-22 13:12:18,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:12:18,325 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:18,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:12:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-22 13:12:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-22 13:12:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:12:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2024-11-22 13:12:18,338 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 146 transitions. Word has length 104 [2024-11-22 13:12:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:18,339 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 146 transitions. [2024-11-22 13:12:18,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2024-11-22 13:12:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 13:12:18,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:18,341 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:18,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 13:12:18,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:12:18,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:18,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1195615656, now seen corresponding path program 1 times [2024-11-22 13:12:18,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:12:18,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890636022] [2024-11-22 13:12:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:18,543 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-22 13:12:18,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:12:18,547 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:12:18,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 13:12:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:18,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 13:12:18,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:12:18,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:18,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:12:18,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890636022] [2024-11-22 13:12:18,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890636022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:18,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:18,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:12:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465243276] [2024-11-22 13:12:18,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:18,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:12:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:12:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:12:18,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:12:18,934 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:19,016 INFO L93 Difference]: Finished difference Result 214 states and 293 transitions. [2024-11-22 13:12:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:12:19,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-22 13:12:19,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:19,019 INFO L225 Difference]: With dead ends: 214 [2024-11-22 13:12:19,019 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 13:12:19,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:12:19,022 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:19,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 755 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:12:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 13:12:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-22 13:12:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 13:12:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 148 transitions. [2024-11-22 13:12:19,043 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 148 transitions. Word has length 104 [2024-11-22 13:12:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:19,043 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 148 transitions. [2024-11-22 13:12:19,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 148 transitions. [2024-11-22 13:12:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 13:12:19,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:19,045 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:19,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 13:12:19,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:12:19,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:19,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:19,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1197462698, now seen corresponding path program 1 times [2024-11-22 13:12:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:12:19,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392979491] [2024-11-22 13:12:19,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:19,247 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-22 13:12:19,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:12:19,250 INFO L229 MonitoredProcess]: Starting monitored process 7 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-22 13:12:19,251 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 (7)] Waiting until timeout for monitored process [2024-11-22 13:12:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:19,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 13:12:19,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:19,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 97 [2024-11-22 13:12:19,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 138 [2024-11-22 13:12:20,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 13:12:20,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-22 13:12:20,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:12:20,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 28 [2024-11-22 13:12:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 13:12:20,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:20,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:12:20,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392979491] [2024-11-22 13:12:20,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392979491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:20,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:20,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:12:20,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850964960] [2024-11-22 13:12:20,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:20,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:12:20,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:12:20,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:12:20,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:12:20,385 INFO L87 Difference]: Start difference. First operand 109 states and 148 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 13:12:23,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]