./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.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 c3a2d291e2452542ab6962635da2f74c802677a527b9a558cac3248bce42ee2c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:53:28,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:53:28,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:53:28,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:53:28,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:53:28,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:53:28,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:53:28,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:53:28,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:53:28,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:53:28,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:53:28,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:53:28,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:53:28,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:53:28,488 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:53:28,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:53:28,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:53:28,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:53:28,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:53:28,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:53:28,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:53:28,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:53:28,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:53:28,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:53:28,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:53:28,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:53:28,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:53:28,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:53:28,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:53:28,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:53:28,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:53:28,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:53:28,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:53:28,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:53:28,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:53:28,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:53:28,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:53:28,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:53:28,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:53:28,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:53:28,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:53:28,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:53:28,496 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 -> c3a2d291e2452542ab6962635da2f74c802677a527b9a558cac3248bce42ee2c [2024-10-14 13:53:28,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:53:28,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:53:28,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:53:28,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:53:28,711 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:53:28,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i [2024-10-14 13:53:29,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:53:30,084 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:53:30,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i [2024-10-14 13:53:30,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274c941e1/c50c3e2bb9974b818220b9b3c33d1eb1/FLAG176599c09 [2024-10-14 13:53:30,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274c941e1/c50c3e2bb9974b818220b9b3c33d1eb1 [2024-10-14 13:53:30,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:53:30,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:53:30,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:53:30,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:53:30,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:53:30,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eece7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30, skipping insertion in model container [2024-10-14 13:53:30,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:53:30,276 WARN L248 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-19.i[916,929] [2024-10-14 13:53:30,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:53:30,379 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:53:30,389 WARN L248 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-19.i[916,929] [2024-10-14 13:53:30,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:53:30,440 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:53:30,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30 WrapperNode [2024-10-14 13:53:30,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:53:30,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:53:30,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:53:30,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:53:30,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,492 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 460 [2024-10-14 13:53:30,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:53:30,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:53:30,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:53:30,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:53:30,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,521 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 15 writes are split as follows [0, 15]. [2024-10-14 13:53:30,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:53:30,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:53:30,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:53:30,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:53:30,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (1/1) ... [2024-10-14 13:53:30,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:53:30,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:53:30,610 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-10-14 13:53:30,612 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-10-14 13:53:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:53:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:53:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:53:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:53:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:53:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:53:30,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:53:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:53:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:53:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:53:30,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:53:30,727 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:53:30,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:53:31,049 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-14 13:53:31,050 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:53:31,078 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:53:31,079 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:53:31,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:53:31 BoogieIcfgContainer [2024-10-14 13:53:31,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:53:31,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:53:31,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:53:31,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:53:31,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:53:30" (1/3) ... [2024-10-14 13:53:31,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c254e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:53:31, skipping insertion in model container [2024-10-14 13:53:31,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:30" (2/3) ... [2024-10-14 13:53:31,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c254e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:53:31, skipping insertion in model container [2024-10-14 13:53:31,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:53:31" (3/3) ... [2024-10-14 13:53:31,088 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-19.i [2024-10-14 13:53:31,102 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:53:31,102 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:53:31,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:53:31,149 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;@985723d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:53:31,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:53:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:53:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:53:31,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:31,161 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:31,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:31,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:31,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1075704495, now seen corresponding path program 1 times [2024-10-14 13:53:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:31,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334319147] [2024-10-14 13:53:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:53:31,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334319147] [2024-10-14 13:53:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334319147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:53:31,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:53:31,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:53:31,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73048703] [2024-10-14 13:53:31,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:53:31,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:53:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:31,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:53:31,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:53:31,517 INFO L87 Difference]: Start difference. First operand has 95 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:53:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:31,553 INFO L93 Difference]: Finished difference Result 187 states and 297 transitions. [2024-10-14 13:53:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:53:31,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 127 [2024-10-14 13:53:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:31,562 INFO L225 Difference]: With dead ends: 187 [2024-10-14 13:53:31,562 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 13:53:31,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10-14 13:53:31,568 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:31,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:53:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 13:53:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-14 13:53:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:53:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2024-10-14 13:53:31,601 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 127 [2024-10-14 13:53:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:31,601 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2024-10-14 13:53:31,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:53:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2024-10-14 13:53:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:53:31,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:31,604 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:31,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:53:31,604 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:31,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1854594991, now seen corresponding path program 1 times [2024-10-14 13:53:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:31,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953175479] [2024-10-14 13:53:31,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:53:31,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:31,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953175479] [2024-10-14 13:53:31,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953175479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:53:31,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:53:31,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:53:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707079635] [2024-10-14 13:53:31,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:53:31,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:53:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:31,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:53:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:53:31,875 INFO L87 Difference]: Start difference. First operand 93 states and 134 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:53:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:31,917 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2024-10-14 13:53:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:53:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-14 13:53:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:31,919 INFO L225 Difference]: With dead ends: 188 [2024-10-14 13:53:31,919 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 13:53:31,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-14 13:53:31,921 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:31,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 377 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:53:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 13:53:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-14 13:53:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:53:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2024-10-14 13:53:31,929 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 127 [2024-10-14 13:53:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:31,930 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2024-10-14 13:53:31,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:53:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2024-10-14 13:53:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:53:31,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:31,932 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:31,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:53:31,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:31,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1854535409, now seen corresponding path program 1 times [2024-10-14 13:53:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:31,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663655632] [2024-10-14 13:53:31,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:53:33,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663655632] [2024-10-14 13:53:33,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663655632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:53:33,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:53:33,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:53:33,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481201142] [2024-10-14 13:53:33,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:53:33,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:53:33,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:33,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:53:33,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:53:33,574 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:53:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:34,110 INFO L93 Difference]: Finished difference Result 248 states and 351 transitions. [2024-10-14 13:53:34,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:53:34,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 127 [2024-10-14 13:53:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:34,112 INFO L225 Difference]: With dead ends: 248 [2024-10-14 13:53:34,112 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 13:53:34,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:53:34,116 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:34,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 765 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:53:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 13:53:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-10-14 13:53:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.328) internal successors, (166), 126 states have internal predecessors, (166), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 13:53:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 212 transitions. [2024-10-14 13:53:34,131 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 212 transitions. Word has length 127 [2024-10-14 13:53:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:34,132 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 212 transitions. [2024-10-14 13:53:34,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:53:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 212 transitions. [2024-10-14 13:53:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:53:34,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:34,135 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:34,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:53:34,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:34,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1419363533, now seen corresponding path program 1 times [2024-10-14 13:53:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:34,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978210202] [2024-10-14 13:53:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:53:34,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:34,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978210202] [2024-10-14 13:53:34,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978210202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:53:34,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:53:34,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:53:34,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870586450] [2024-10-14 13:53:34,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:53:34,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:53:34,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:34,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:53:34,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:53:34,365 INFO L87 Difference]: Start difference. First operand 151 states and 212 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:53:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:34,609 INFO L93 Difference]: Finished difference Result 369 states and 516 transitions. [2024-10-14 13:53:34,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:53:34,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-14 13:53:34,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:34,616 INFO L225 Difference]: With dead ends: 369 [2024-10-14 13:53:34,616 INFO L226 Difference]: Without dead ends: 219 [2024-10-14 13:53:34,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-10-14 13:53:34,618 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 78 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:34,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 519 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:53:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-14 13:53:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2024-10-14 13:53:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 177 states have (on average 1.310734463276836) internal successors, (232), 179 states have internal predecessors, (232), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 13:53:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 302 transitions. [2024-10-14 13:53:34,648 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 302 transitions. Word has length 127 [2024-10-14 13:53:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:34,649 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 302 transitions. [2024-10-14 13:53:34,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:53:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 302 transitions. [2024-10-14 13:53:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:53:34,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:34,650 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:34,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:53:34,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:34,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2052492512, now seen corresponding path program 1 times [2024-10-14 13:53:34,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:34,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584120200] [2024-10-14 13:53:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:53:36,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:36,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584120200] [2024-10-14 13:53:36,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584120200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:53:36,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:53:36,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 13:53:36,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562476470] [2024-10-14 13:53:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:53:36,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 13:53:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 13:53:36,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:53:36,035 INFO L87 Difference]: Start difference. First operand 216 states and 302 transitions. Second operand has 11 states, 8 states have (on average 5.75) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-14 13:53:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:36,555 INFO L93 Difference]: Finished difference Result 498 states and 692 transitions. [2024-10-14 13:53:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 13:53:36,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.75) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) Word has length 128 [2024-10-14 13:53:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:36,558 INFO L225 Difference]: With dead ends: 498 [2024-10-14 13:53:36,558 INFO L226 Difference]: Without dead ends: 283 [2024-10-14 13:53:36,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:53:36,559 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 43 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:36,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 779 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:53:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-14 13:53:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 228. [2024-10-14 13:53:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.312169312169312) internal successors, (248), 191 states have internal predecessors, (248), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 13:53:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2024-10-14 13:53:36,574 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 128 [2024-10-14 13:53:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:36,574 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2024-10-14 13:53:36,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.75) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-14 13:53:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2024-10-14 13:53:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:53:36,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:36,576 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:36,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:53:36,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:36,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:36,577 INFO L85 PathProgramCache]: Analyzing trace with hash -221563996, now seen corresponding path program 1 times [2024-10-14 13:53:36,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:36,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582861008] [2024-10-14 13:53:36,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:36,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:53:37,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:37,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582861008] [2024-10-14 13:53:37,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582861008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:53:37,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:53:37,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:53:37,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390110394] [2024-10-14 13:53:37,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:53:37,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:53:37,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:53:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:53:37,758 INFO L87 Difference]: Start difference. First operand 228 states and 318 transitions. Second operand has 10 states, 8 states have (on average 5.875) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-14 13:53:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:38,340 INFO L93 Difference]: Finished difference Result 561 states and 779 transitions. [2024-10-14 13:53:38,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 13:53:38,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 129 [2024-10-14 13:53:38,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:38,342 INFO L225 Difference]: With dead ends: 561 [2024-10-14 13:53:38,342 INFO L226 Difference]: Without dead ends: 330 [2024-10-14 13:53:38,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:53:38,343 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 65 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:38,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 845 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:53:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-14 13:53:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 249. [2024-10-14 13:53:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 210 states have (on average 1.3142857142857143) internal successors, (276), 212 states have internal predecessors, (276), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 13:53:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 346 transitions. [2024-10-14 13:53:38,361 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 346 transitions. Word has length 129 [2024-10-14 13:53:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:38,362 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 346 transitions. [2024-10-14 13:53:38,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-14 13:53:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 346 transitions. [2024-10-14 13:53:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:53:38,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:38,363 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:53:38,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:38,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash -172232835, now seen corresponding path program 1 times [2024-10-14 13:53:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:38,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664108007] [2024-10-14 13:53:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:53:40,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:40,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664108007] [2024-10-14 13:53:40,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664108007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:53:40,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:53:40,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:53:40,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775664861] [2024-10-14 13:53:40,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:53:40,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:53:40,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:53:40,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:53:40,150 INFO L87 Difference]: Start difference. First operand 249 states and 346 transitions. Second operand has 10 states, 6 states have (on average 7.833333333333333) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-14 13:53:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:40,815 INFO L93 Difference]: Finished difference Result 591 states and 819 transitions. [2024-10-14 13:53:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 13:53:40,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 6 states have (on average 7.833333333333333) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) Word has length 129 [2024-10-14 13:53:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:40,817 INFO L225 Difference]: With dead ends: 591 [2024-10-14 13:53:40,818 INFO L226 Difference]: Without dead ends: 343 [2024-10-14 13:53:40,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:53:40,820 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 57 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:40,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 854 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:53:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-14 13:53:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 245. [2024-10-14 13:53:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 206 states have (on average 1.3058252427184467) internal successors, (269), 208 states have internal predecessors, (269), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 13:53:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 339 transitions. [2024-10-14 13:53:40,837 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 339 transitions. Word has length 129 [2024-10-14 13:53:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:40,837 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 339 transitions. [2024-10-14 13:53:40,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 6 states have (on average 7.833333333333333) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-14 13:53:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 339 transitions. [2024-10-14 13:53:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:53:40,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:40,840 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:40,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:53:40,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:40,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1324981035, now seen corresponding path program 1 times [2024-10-14 13:53:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470621122] [2024-10-14 13:53:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:53:41,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:41,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470621122] [2024-10-14 13:53:41,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470621122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:53:41,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:53:41,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:53:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404210707] [2024-10-14 13:53:41,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:53:41,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:53:41,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:53:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:53:41,192 INFO L87 Difference]: Start difference. First operand 245 states and 339 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:53:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:41,388 INFO L93 Difference]: Finished difference Result 566 states and 781 transitions. [2024-10-14 13:53:41,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:53:41,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-14 13:53:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:41,391 INFO L225 Difference]: With dead ends: 566 [2024-10-14 13:53:41,391 INFO L226 Difference]: Without dead ends: 322 [2024-10-14 13:53:41,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 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-10-14 13:53:41,393 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 77 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:41,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 444 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:53:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-14 13:53:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2024-10-14 13:53:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 269 states have (on average 1.3011152416356877) internal successors, (350), 272 states have internal predecessors, (350), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-14 13:53:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 440 transitions. [2024-10-14 13:53:41,410 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 440 transitions. Word has length 130 [2024-10-14 13:53:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:41,411 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 440 transitions. [2024-10-14 13:53:41,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:53:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 440 transitions. [2024-10-14 13:53:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:53:41,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:41,412 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:41,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:53:41,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:41,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:41,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1066815597, now seen corresponding path program 1 times [2024-10-14 13:53:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502659226] [2024-10-14 13:53:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:53:41,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:41,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502659226] [2024-10-14 13:53:41,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502659226] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:53:41,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125361396] [2024-10-14 13:53:41,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:41,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:53:41,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:53:41,819 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-10-14 13:53:41,820 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-10-14 13:53:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:41,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 13:53:41,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:53:42,038 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-10-14 13:53:42,059 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-10-14 13:53:42,088 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-10-14 13:53:42,096 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-10-14 13:53:42,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:42,106 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-10-14 13:53:42,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:42,132 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 10 [2024-10-14 13:53:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-14 13:53:42,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:53:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:53:42,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125361396] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:53:42,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:53:42,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2024-10-14 13:53:42,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729513334] [2024-10-14 13:53:42,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:53:42,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:53:42,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:42,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:53:42,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:53:42,327 INFO L87 Difference]: Start difference. First operand 319 states and 440 transitions. Second operand has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-14 13:53:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:42,843 INFO L93 Difference]: Finished difference Result 786 states and 1072 transitions. [2024-10-14 13:53:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 13:53:42,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) Word has length 130 [2024-10-14 13:53:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:42,846 INFO L225 Difference]: With dead ends: 786 [2024-10-14 13:53:42,846 INFO L226 Difference]: Without dead ends: 468 [2024-10-14 13:53:42,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 287 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-10-14 13:53:42,847 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 482 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:42,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 266 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:53:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-10-14 13:53:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 452. [2024-10-14 13:53:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 386 states have (on average 1.2953367875647668) internal successors, (500), 391 states have internal predecessors, (500), 57 states have call successors, (57), 8 states have call predecessors, (57), 8 states have return successors, (57), 52 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-14 13:53:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 614 transitions. [2024-10-14 13:53:42,874 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 614 transitions. Word has length 130 [2024-10-14 13:53:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:42,875 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 614 transitions. [2024-10-14 13:53:42,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-14 13:53:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 614 transitions. [2024-10-14 13:53:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:53:42,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:42,876 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:42,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:53:43,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:53:43,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:43,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash -363962707, now seen corresponding path program 1 times [2024-10-14 13:53:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:43,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478283506] [2024-10-14 13:53:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:53:43,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:43,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478283506] [2024-10-14 13:53:43,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478283506] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:53:43,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919330621] [2024-10-14 13:53:43,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:43,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:53:43,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:53:43,960 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-10-14 13:53:43,961 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-10-14 13:53:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:44,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-14 13:53:44,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:53:44,092 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-10-14 13:53:44,096 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-10-14 13:53:44,099 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-10-14 13:53:44,102 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-10-14 13:53:44,106 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-10-14 13:53:44,109 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-10-14 13:53:44,112 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-10-14 13:53:44,115 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 19 treesize of output 19 [2024-10-14 13:53:44,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:44,165 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 88 treesize of output 64 [2024-10-14 13:53:44,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:44,316 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 89 treesize of output 35 [2024-10-14 13:53:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:53:44,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:53:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:53:44,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919330621] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:53:44,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:53:44,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 11] total 23 [2024-10-14 13:53:44,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986655789] [2024-10-14 13:53:44,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:53:44,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:53:44,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:44,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:53:44,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-14 13:53:44,638 INFO L87 Difference]: Start difference. First operand 452 states and 614 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:53:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:45,067 INFO L93 Difference]: Finished difference Result 1025 states and 1386 transitions. [2024-10-14 13:53:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:53:45,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-14 13:53:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:45,072 INFO L225 Difference]: With dead ends: 1025 [2024-10-14 13:53:45,072 INFO L226 Difference]: Without dead ends: 574 [2024-10-14 13:53:45,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2024-10-14 13:53:45,075 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 68 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:45,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 764 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:53:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-14 13:53:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 566. [2024-10-14 13:53:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 490 states have (on average 1.2938775510204081) internal successors, (634), 497 states have internal predecessors, (634), 65 states have call successors, (65), 10 states have call predecessors, (65), 10 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-14 13:53:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 764 transitions. [2024-10-14 13:53:45,107 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 764 transitions. Word has length 130 [2024-10-14 13:53:45,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:45,107 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 764 transitions. [2024-10-14 13:53:45,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:53:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 764 transitions. [2024-10-14 13:53:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:53:45,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:45,109 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:45,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 13:53:45,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 13:53:45,310 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:45,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1986833892, now seen corresponding path program 1 times [2024-10-14 13:53:45,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:45,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113578027] [2024-10-14 13:53:45,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:53:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:53:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:53:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:53:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:53:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:53:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:53:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:53:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:53:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:53:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:53:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:53:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:53:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:53:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:53:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:53:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:53:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:53:46,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:53:46,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113578027] [2024-10-14 13:53:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113578027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:53:46,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:53:46,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:53:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559990707] [2024-10-14 13:53:46,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:53:46,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:53:46,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:53:46,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:53:46,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:53:46,554 INFO L87 Difference]: Start difference. First operand 566 states and 764 transitions. Second operand has 9 states, 5 states have (on average 9.6) internal successors, (48), 9 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-14 13:53:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:53:47,000 INFO L93 Difference]: Finished difference Result 1355 states and 1832 transitions. [2024-10-14 13:53:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:53:47,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 9.6) internal successors, (48), 9 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) Word has length 130 [2024-10-14 13:53:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:53:47,004 INFO L225 Difference]: With dead ends: 1355 [2024-10-14 13:53:47,004 INFO L226 Difference]: Without dead ends: 785 [2024-10-14 13:53:47,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:53:47,006 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 53 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:53:47,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 625 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:53:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-14 13:53:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 557. [2024-10-14 13:53:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 481 states have (on average 1.2785862785862785) internal successors, (615), 488 states have internal predecessors, (615), 65 states have call successors, (65), 10 states have call predecessors, (65), 10 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-14 13:53:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 745 transitions. [2024-10-14 13:53:47,032 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 745 transitions. Word has length 130 [2024-10-14 13:53:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:53:47,032 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 745 transitions. [2024-10-14 13:53:47,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 9.6) internal successors, (48), 9 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-14 13:53:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 745 transitions. [2024-10-14 13:53:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:53:47,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:53:47,034 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:53:47,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 13:53:47,035 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:53:47,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:53:47,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1580469733, now seen corresponding path program 1 times [2024-10-14 13:53:47,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:53:47,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695464727] [2024-10-14 13:53:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:47,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:53:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:53:47,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221925082] [2024-10-14 13:53:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:53:47,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:53:47,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:53:47,106 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-10-14 13:53:47,107 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-10-14 13:53:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:47,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-10-14 13:53:47,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:53:47,508 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 0 case distinctions, treesize of input 67 treesize of output 54 [2024-10-14 13:53:47,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:47,714 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 78 treesize of output 59 [2024-10-14 13:53:47,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:47,925 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 80 treesize of output 70 [2024-10-14 13:53:48,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:48,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 84 [2024-10-14 13:53:48,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:48,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 84 [2024-10-14 13:53:48,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:48,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 75 [2024-10-14 13:53:48,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:48,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 84 [2024-10-14 13:53:49,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:49,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 75 [2024-10-14 13:53:49,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:49,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 123 treesize of output 107 [2024-10-14 13:53:49,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 119 [2024-10-14 13:53:49,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:49,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 185 treesize of output 139 [2024-10-14 13:53:50,278 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 255 treesize of output 195 [2024-10-14 13:53:50,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:53:50,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 195 treesize of output 251 [2024-10-14 13:53:50,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 55 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 139 [2024-10-14 13:54:15,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:15,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 480 treesize of output 172 [2024-10-14 13:54:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 79 proven. 428 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-14 13:54:16,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:54:18,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:54:18,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695464727] [2024-10-14 13:54:18,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:54:18,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221925082] [2024-10-14 13:54:18,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221925082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:54:18,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:54:18,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2024-10-14 13:54:18,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042360028] [2024-10-14 13:54:18,907 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 13:54:18,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-14 13:54:18,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:54:18,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-14 13:54:18,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2382, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 13:54:18,908 INFO L87 Difference]: Start difference. First operand 557 states and 745 transitions. Second operand has 39 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 37 states have internal predecessors, (81), 12 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) [2024-10-14 13:54:28,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-14 13:54:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:54:30,243 INFO L93 Difference]: Finished difference Result 1897 states and 2517 transitions. [2024-10-14 13:54:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-14 13:54:30,243 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 37 states have internal predecessors, (81), 12 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) Word has length 130 [2024-10-14 13:54:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:54:30,247 INFO L225 Difference]: With dead ends: 1897 [2024-10-14 13:54:30,247 INFO L226 Difference]: Without dead ends: 1341 [2024-10-14 13:54:30,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=567, Invalid=4545, Unknown=0, NotChecked=0, Total=5112 [2024-10-14 13:54:30,249 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 579 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 3261 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:54:30,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1512 Invalid, 3301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3261 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2024-10-14 13:54:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-10-14 13:54:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 644. [2024-10-14 13:54:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 542 states have (on average 1.2619926199261993) internal successors, (684), 549 states have internal predecessors, (684), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-14 13:54:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 848 transitions. [2024-10-14 13:54:30,284 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 848 transitions. Word has length 130 [2024-10-14 13:54:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:54:30,284 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 848 transitions. [2024-10-14 13:54:30,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 37 states have internal predecessors, (81), 12 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) [2024-10-14 13:54:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 848 transitions. [2024-10-14 13:54:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:54:30,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:54:30,286 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:54:30,304 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-10-14 13:54:30,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:54:30,487 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:54:30,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:54:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1838635171, now seen corresponding path program 1 times [2024-10-14 13:54:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:54:30,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096191643] [2024-10-14 13:54:30,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:54:30,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:54:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:54:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:54:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:54:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:54:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:54:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:54:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:54:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:54:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:54:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:54:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:54:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:54:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:54:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:54:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:54:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:54:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:54:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:54:30,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:54:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096191643] [2024-10-14 13:54:30,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096191643] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:54:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907805362] [2024-10-14 13:54:30,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:54:30,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:54:30,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:54:30,864 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-10-14 13:54:30,865 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-10-14 13:54:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:30,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 13:54:30,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:54:31,010 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-10-14 13:54:31,047 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-10-14 13:54:31,073 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-10-14 13:54:31,079 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-10-14 13:54:31,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:31,085 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-10-14 13:54:31,112 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 96 treesize of output 70 [2024-10-14 13:54:31,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:31,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 110 [2024-10-14 13:54:31,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:54:31,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 48 [2024-10-14 13:54:31,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:31,263 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 115 treesize of output 41 [2024-10-14 13:54:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-14 13:54:31,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:54:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:54:31,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907805362] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:54:31,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:54:31,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 13 [2024-10-14 13:54:31,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091605406] [2024-10-14 13:54:31,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:54:31,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 13:54:31,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:54:31,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 13:54:31,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:54:31,395 INFO L87 Difference]: Start difference. First operand 644 states and 848 transitions. Second operand has 13 states, 10 states have (on average 7.0) internal successors, (70), 13 states have internal predecessors, (70), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-14 13:54:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:54:32,032 INFO L93 Difference]: Finished difference Result 1231 states and 1621 transitions. [2024-10-14 13:54:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 13:54:32,033 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.0) internal successors, (70), 13 states have internal predecessors, (70), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) Word has length 130 [2024-10-14 13:54:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:54:32,035 INFO L225 Difference]: With dead ends: 1231 [2024-10-14 13:54:32,035 INFO L226 Difference]: Without dead ends: 675 [2024-10-14 13:54:32,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 287 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2024-10-14 13:54:32,037 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 492 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:54:32,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 387 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:54:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-14 13:54:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 644. [2024-10-14 13:54:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 542 states have (on average 1.2453874538745386) internal successors, (675), 549 states have internal predecessors, (675), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-14 13:54:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 839 transitions. [2024-10-14 13:54:32,067 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 839 transitions. Word has length 130 [2024-10-14 13:54:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:54:32,067 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 839 transitions. [2024-10-14 13:54:32,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.0) internal successors, (70), 13 states have internal predecessors, (70), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-14 13:54:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 839 transitions. [2024-10-14 13:54:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:54:32,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:54:32,069 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:54:32,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 13:54:32,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:54:32,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:54:32,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:54:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash 720352857, now seen corresponding path program 1 times [2024-10-14 13:54:32,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:54:32,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373389431] [2024-10-14 13:54:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:54:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:54:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:54:32,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805568150] [2024-10-14 13:54:32,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:54:32,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:54:32,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:54:32,333 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-10-14 13:54:32,334 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-10-14 13:54:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:32,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-10-14 13:54:32,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:54:32,682 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 0 case distinctions, treesize of input 67 treesize of output 54 [2024-10-14 13:54:32,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:32,895 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 78 treesize of output 68 [2024-10-14 13:54:33,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:33,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 82 [2024-10-14 13:54:33,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:33,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 100 treesize of output 96 [2024-10-14 13:54:33,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:33,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 100 treesize of output 87 [2024-10-14 13:54:33,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2024-10-14 13:54:33,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:33,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 89 [2024-10-14 13:54:34,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:34,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 80 [2024-10-14 13:54:34,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:34,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 121 treesize of output 112 [2024-10-14 13:54:34,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 130 [2024-10-14 13:54:34,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:34,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 211 treesize of output 147 [2024-10-14 13:54:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 68 proven. 431 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-14 13:54:37,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:54:42,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:54:42,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373389431] [2024-10-14 13:54:42,051 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:54:42,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805568150] [2024-10-14 13:54:42,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805568150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:54:42,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:54:42,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2024-10-14 13:54:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836308360] [2024-10-14 13:54:42,051 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 13:54:42,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 13:54:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:54:42,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 13:54:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1859, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 13:54:42,053 INFO L87 Difference]: Start difference. First operand 644 states and 839 transitions. Second operand has 34 states, 30 states have (on average 2.5) internal successors, (75), 32 states have internal predecessors, (75), 10 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-14 13:54:46,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-14 13:54:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:54:49,469 INFO L93 Difference]: Finished difference Result 1897 states and 2485 transitions. [2024-10-14 13:54:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-14 13:54:49,469 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 2.5) internal successors, (75), 32 states have internal predecessors, (75), 10 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17) Word has length 130 [2024-10-14 13:54:49,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:54:49,473 INFO L225 Difference]: With dead ends: 1897 [2024-10-14 13:54:49,473 INFO L226 Difference]: Without dead ends: 1341 [2024-10-14 13:54:49,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=574, Invalid=3458, Unknown=0, NotChecked=0, Total=4032 [2024-10-14 13:54:49,475 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 435 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:54:49,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1547 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-14 13:54:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-10-14 13:54:49,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 675. [2024-10-14 13:54:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 572 states have (on average 1.2412587412587412) internal successors, (710), 579 states have internal predecessors, (710), 82 states have call successors, (82), 20 states have call predecessors, (82), 20 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-14 13:54:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 874 transitions. [2024-10-14 13:54:49,507 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 874 transitions. Word has length 130 [2024-10-14 13:54:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:54:49,508 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 874 transitions. [2024-10-14 13:54:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 2.5) internal successors, (75), 32 states have internal predecessors, (75), 10 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-14 13:54:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 874 transitions. [2024-10-14 13:54:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:54:49,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:54:49,509 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:54:49,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 13:54:49,710 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,SelfDestructingSolverStorable13 [2024-10-14 13:54:49,710 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:54:49,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:54:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1439921123, now seen corresponding path program 1 times [2024-10-14 13:54:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:54:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894442905] [2024-10-14 13:54:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:54:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:54:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:54:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1856362266] [2024-10-14 13:54:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:54:49,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:54:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:54:49,749 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-10-14 13:54:49,749 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-10-14 13:54:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:54:50,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:54:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:54:50,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:54:50,417 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:54:50,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:54:50,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 13:54:50,619 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,SelfDestructingSolverStorable14 [2024-10-14 13:54:50,622 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:54:50,674 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:54:50,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:54:50 BoogieIcfgContainer [2024-10-14 13:54:50,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:54:50,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:54:50,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:54:50,678 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:54:50,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:53:31" (3/4) ... [2024-10-14 13:54:50,679 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:54:50,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:54:50,680 INFO L158 Benchmark]: Toolchain (without parser) took 80567.98ms. Allocated memory was 153.1MB in the beginning and 771.8MB in the end (delta: 618.7MB). Free memory was 85.4MB in the beginning and 629.1MB in the end (delta: -543.7MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2024-10-14 13:54:50,681 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 115.3MB. Free memory was 77.3MB in the beginning and 77.2MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:54:50,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.95ms. Allocated memory is still 153.1MB. Free memory was 85.3MB in the beginning and 121.6MB in the end (delta: -36.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 13:54:50,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.34ms. Allocated memory is still 153.1MB. Free memory was 121.6MB in the beginning and 117.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:54:50,682 INFO L158 Benchmark]: Boogie Preprocessor took 71.75ms. Allocated memory is still 153.1MB. Free memory was 117.4MB in the beginning and 112.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:54:50,682 INFO L158 Benchmark]: RCFGBuilder took 513.29ms. Allocated memory is still 153.1MB. Free memory was 112.6MB in the beginning and 79.6MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 13:54:50,682 INFO L158 Benchmark]: TraceAbstraction took 79596.90ms. Allocated memory was 153.1MB in the beginning and 771.8MB in the end (delta: 618.7MB). Free memory was 79.1MB in the beginning and 630.2MB in the end (delta: -551.1MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-10-14 13:54:50,683 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 771.8MB. Free memory was 630.2MB in the beginning and 629.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:54:50,685 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.12ms. Allocated memory is still 115.3MB. Free memory was 77.3MB in the beginning and 77.2MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.95ms. Allocated memory is still 153.1MB. Free memory was 85.3MB in the beginning and 121.6MB in the end (delta: -36.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.34ms. Allocated memory is still 153.1MB. Free memory was 121.6MB in the beginning and 117.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.75ms. Allocated memory is still 153.1MB. Free memory was 117.4MB in the beginning and 112.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 513.29ms. Allocated memory is still 153.1MB. Free memory was 112.6MB in the beginning and 79.6MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 79596.90ms. Allocated memory was 153.1MB in the beginning and 771.8MB in the end (delta: 618.7MB). Free memory was 79.1MB in the beginning and 630.2MB in the end (delta: -551.1MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 771.8MB. Free memory was 630.2MB in the beginning and 629.1MB in the end (delta: 1.0MB). 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 shiftLeft at line 113. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 8, 128, 64, 1, 5, 4, 100, 1, -8, 10, -25, -16 }; [L51] signed long int last_1_WrapperStruct00_var_1_11 = 10; [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_11 [L110] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L120] RET updateLastVariables() [L121] CALL updateVariables() [L83] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L85] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L86] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ulong() [L90] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 12) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 12) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L92] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L93] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 11) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_char() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L101] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L103] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_long() [L105] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L121] RET updateVariables() [L122] CALL step() [L55] EXPR WrapperStruct00.var_1_7 [L55] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L55] COND TRUE WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3 [L56] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L56] COND FALSE !(last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) [L64] EXPR WrapperStruct00.var_1_7 [L64] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_7 [L65] EXPR WrapperStruct00.var_1_2 [L65] EXPR WrapperStruct00.var_1_12 [L65] signed long int stepLocal_1 = WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12; [L66] EXPR WrapperStruct00.var_1_10 [L66] EXPR WrapperStruct00.var_1_13 [L66] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L66] COND FALSE !(((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > stepLocal_1) [L71] EXPR WrapperStruct00.var_1_7 [L71] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_7 [L73] EXPR WrapperStruct00.var_1_11 [L73] signed long int stepLocal_0 = WrapperStruct00.var_1_11; [L74] EXPR WrapperStruct00.var_1_2 [L74] EXPR WrapperStruct00.var_1_3 [L74] EXPR WrapperStruct00.var_1_4 [L74] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L74] EXPR (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10, stepLocal_0=10] [L74] COND FALSE !(((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= stepLocal_0) [L77] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L77] COND TRUE WrapperStruct00.var_1_9 [L78] EXPR WrapperStruct00.var_1_5 [L78] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_5 [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR WrapperStruct00.var_1_2 [L113] EXPR WrapperStruct00.var_1_3 [L113] EXPR WrapperStruct00.var_1_4 [L113] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1) [L113] EXPR WrapperStruct00.var_1_1 [L113] EXPR WrapperStruct00.var_1_4 [L113] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) [L113] EXPR WrapperStruct00.var_1_8 [L113] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))) [L113] EXPR WrapperStruct00.var_1_4 [L113] EXPR ((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1))) && ((((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_2)) : 1) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1))) && ((((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_2)) : 1) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1))) && ((((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_2)) : 1) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1))) && ((((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_2)) : 1) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L113-L114] return ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) << (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)) <= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8)))))))) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) : 1)) && ((WrapperStruct00.var_1_7 < WrapperStruct00.var_1_3) ? ((last_1_WrapperStruct00_var_1_11 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_3 - WrapperStruct00.var_1_8))) : 1) : (((WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))) > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_8)) : 1))) && ((((WrapperStruct00.var_1_10 * WrapperStruct00.var_1_13) + WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_2 / WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_2)) : 1) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 79.5s, OverallIterations: 15, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2562 SdHoareTripleChecker+Valid, 19.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2495 mSDsluCounter, 9814 SdHoareTripleChecker+Invalid, 18.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8098 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12014 IncrementalHoareTripleChecker+Invalid, 12285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 1716 mSDtfsCounter, 12014 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1775 GetRequests, 1498 SyntacticMatches, 15 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3445 ImplicationChecksByTransitivity, 38.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=675occurred in iteration=14, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1890 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 51.4s InterpolantComputationTime, 2714 NumberOfCodeBlocks, 2714 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2564 ConstructedInterpolants, 24 QuantifiedInterpolants, 30540 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1914 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 9835/10880 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-10-14 13:54:50,883 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.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 c3a2d291e2452542ab6962635da2f74c802677a527b9a558cac3248bce42ee2c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:54:52,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:54:52,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:54:52,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:54:52,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:54:52,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:54:52,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:54:52,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:54:52,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:54:52,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:54:52,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:54:52,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:54:52,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:54:52,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:54:52,519 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:54:52,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:54:52,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:54:52,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:54:52,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:54:52,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:54:52,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:54:52,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:54:52,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:54:52,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:54:52,522 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:54:52,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:54:52,522 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:54:52,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:54:52,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:54:52,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:54:52,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:54:52,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:54:52,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:54:52,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:54:52,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:54:52,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:54:52,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:54:52,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:54:52,524 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:54:52,524 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:54:52,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:54:52,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:54:52,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:54:52,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:54:52,526 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:54:52,526 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 -> c3a2d291e2452542ab6962635da2f74c802677a527b9a558cac3248bce42ee2c [2024-10-14 13:54:52,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:54:52,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:54:52,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:54:52,793 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:54:52,793 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:54:52,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i [2024-10-14 13:54:54,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:54:54,169 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:54:54,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-19.i [2024-10-14 13:54:54,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7c27ec31/d113f6cc6ddf4682ae5e1af6724602be/FLAG7eefb2875 [2024-10-14 13:54:54,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7c27ec31/d113f6cc6ddf4682ae5e1af6724602be [2024-10-14 13:54:54,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:54:54,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:54:54,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:54:54,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:54:54,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:54:54,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:54,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653bbae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54, skipping insertion in model container [2024-10-14 13:54:54,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:54,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:54:54,735 WARN L248 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-19.i[916,929] [2024-10-14 13:54:54,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:54:54,810 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:54:54,819 WARN L248 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-19.i[916,929] [2024-10-14 13:54:54,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:54:54,882 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:54:54,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54 WrapperNode [2024-10-14 13:54:54,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:54:54,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:54:54,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:54:54,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:54:54,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:54,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:54,940 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2024-10-14 13:54:54,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:54:54,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:54:54,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:54:54,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:54:54,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:54,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:54,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:54,985 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 15 writes are split as follows [0, 15]. [2024-10-14 13:54:54,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:54,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:55,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:55,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:55,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:55,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:55,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:54:55,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:54:55,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:54:55,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:54:55,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (1/1) ... [2024-10-14 13:54:55,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:54:55,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:54:55,072 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-10-14 13:54:55,074 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-10-14 13:54:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:54:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:54:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:54:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:54:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:54:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:54:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:54:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:54:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:54:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:54:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:54:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:54:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:54:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:54:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:54:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:54:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:54:55,197 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:54:55,199 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:54:55,706 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-14 13:54:55,706 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:54:55,755 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:54:55,756 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:54:55,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:54:55 BoogieIcfgContainer [2024-10-14 13:54:55,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:54:55,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:54:55,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:54:55,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:54:55,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:54:54" (1/3) ... [2024-10-14 13:54:55,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1902875d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:54:55, skipping insertion in model container [2024-10-14 13:54:55,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:54:54" (2/3) ... [2024-10-14 13:54:55,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1902875d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:54:55, skipping insertion in model container [2024-10-14 13:54:55,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:54:55" (3/3) ... [2024-10-14 13:54:55,763 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-19.i [2024-10-14 13:54:55,776 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:54:55,776 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:54:55,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:54:55,838 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;@507a1530, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:54:55,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:54:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:54:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 13:54:55,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:54:55,854 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:54:55,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:54:55,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:54:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash -893311310, now seen corresponding path program 1 times [2024-10-14 13:54:55,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:54:55,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617347323] [2024-10-14 13:54:55,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:54:55,873 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-10-14 13:54:55,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:54:55,876 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-10-14 13:54:55,877 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-10-14 13:54:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:56,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:54:56,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:54:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-14 13:54:56,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:54:56,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:54:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617347323] [2024-10-14 13:54:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617347323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:54:56,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:54:56,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:54:56,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257729846] [2024-10-14 13:54:56,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:54:56,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:54:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:54:56,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:54:56,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:54:56,137 INFO L87 Difference]: Start difference. First operand has 90 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:54:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:54:56,173 INFO L93 Difference]: Finished difference Result 177 states and 283 transitions. [2024-10-14 13:54:56,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:54:56,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 124 [2024-10-14 13:54:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:54:56,180 INFO L225 Difference]: With dead ends: 177 [2024-10-14 13:54:56,180 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 13:54:56,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-10-14 13:54:56,185 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:54:56,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:54:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 13:54:56,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 13:54:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:54:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2024-10-14 13:54:56,215 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 124 [2024-10-14 13:54:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:54:56,215 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2024-10-14 13:54:56,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:54:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2024-10-14 13:54:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 13:54:56,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:54:56,217 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 13:54:56,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 13:54:56,418 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-10-14 13:54:56,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:54:56,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:54:56,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1939362736, now seen corresponding path program 1 times [2024-10-14 13:54:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:54:56,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716562662] [2024-10-14 13:54:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:54:56,435 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-10-14 13:54:56,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:54:56,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-10-14 13:54:56,437 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-10-14 13:54:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:54:56,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 13:54:56,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:54:56,695 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-10-14 13:54:56,785 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-10-14 13:54:56,857 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 24 treesize of output 23 [2024-10-14 13:54:56,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:56,991 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 34 treesize of output 36 [2024-10-14 13:54:57,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:57,169 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 49 treesize of output 39 [2024-10-14 13:54:57,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:57,406 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 62 treesize of output 64 [2024-10-14 13:54:57,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:57,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 87 [2024-10-14 13:54:57,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:54:57,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 101