./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:33:31,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:33:31,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:33:31,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:33:31,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:33:31,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:33:31,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:33:31,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:33:31,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:33:31,485 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:33:31,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:33:31,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:33:31,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:33:31,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:33:31,486 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:33:31,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:33:31,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:33:31,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:33:31,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:33:31,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:33:31,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:33:31,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:33:31,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:33:31,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:33:31,489 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:33:31,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:33:31,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:33:31,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:33:31,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:33:31,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:33:31,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:33:31,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:33:31,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:33:31,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:33:31,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:33:31,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:33:31,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:33:31,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:33:31,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:33:31,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:33:31,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:33:31,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:33:31,503 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 -> d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d [2024-11-16 15:33:31,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:33:31,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:33:31,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:33:31,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:33:31,712 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:33:31,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-16 15:33:32,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:33:33,157 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:33:33,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-16 15:33:33,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e4ddcb0/e5dac7e0b6554e578df13c558ab36a3d/FLAG9cb74460c [2024-11-16 15:33:33,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e4ddcb0/e5dac7e0b6554e578df13c558ab36a3d [2024-11-16 15:33:33,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:33:33,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:33:33,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:33:33,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:33:33,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:33:33,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7c4e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33, skipping insertion in model container [2024-11-16 15:33:33,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:33:33,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i[912,925] [2024-11-16 15:33:33,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:33:33,384 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:33:33,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i[912,925] [2024-11-16 15:33:33,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:33:33,429 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:33:33,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33 WrapperNode [2024-11-16 15:33:33,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:33:33,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:33:33,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:33:33,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:33:33,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,478 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-16 15:33:33,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:33:33,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:33:33,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:33:33,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:33:33,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,507 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:33:33,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:33:33,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:33:33,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:33:33,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:33:33,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (1/1) ... [2024-11-16 15:33:33,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:33:33,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:33:33,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:33:33,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:33:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:33:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:33:33,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:33:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:33:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:33:33,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:33:33,655 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:33:33,656 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:33:33,869 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~bitwise15#1;havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-16 15:33:33,899 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 15:33:33,899 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:33:33,923 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:33:33,923 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:33:33,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:33:33 BoogieIcfgContainer [2024-11-16 15:33:33,923 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:33:33,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:33:33,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:33:33,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:33:33,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:33:33" (1/3) ... [2024-11-16 15:33:33,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aac90a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:33:33, skipping insertion in model container [2024-11-16 15:33:33,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:33" (2/3) ... [2024-11-16 15:33:33,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aac90a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:33:33, skipping insertion in model container [2024-11-16 15:33:33,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:33:33" (3/3) ... [2024-11-16 15:33:33,938 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-16 15:33:33,951 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:33:33,951 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:33:33,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:33:34,002 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;@2a9ffb76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:33:34,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:33:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:33:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 15:33:34,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:34,021 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:34,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:34,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1346540300, now seen corresponding path program 1 times [2024-11-16 15:33:34,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:34,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919762131] [2024-11-16 15:33:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:34,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:33:34,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:34,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919762131] [2024-11-16 15:33:34,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919762131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:34,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:33:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849663205] [2024-11-16 15:33:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:34,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:33:34,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:34,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:33:34,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:33:34,392 INFO L87 Difference]: Start difference. First operand has 77 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 15:33:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:34,431 INFO L93 Difference]: Finished difference Result 146 states and 232 transitions. [2024-11-16 15:33:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:33:34,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2024-11-16 15:33:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:34,443 INFO L225 Difference]: With dead ends: 146 [2024-11-16 15:33:34,443 INFO L226 Difference]: Without dead ends: 72 [2024-11-16 15:33:34,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:33:34,448 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:34,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:33:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-16 15:33:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-16 15:33:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:33:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2024-11-16 15:33:34,487 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 110 [2024-11-16 15:33:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:34,488 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2024-11-16 15:33:34,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 15:33:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2024-11-16 15:33:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 15:33:34,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:34,490 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:34,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:33:34,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:34,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1196188465, now seen corresponding path program 1 times [2024-11-16 15:33:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:34,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592668763] [2024-11-16 15:33:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:33:34,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:34,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592668763] [2024-11-16 15:33:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592668763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:34,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:33:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719366820] [2024-11-16 15:33:34,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:34,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:33:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:34,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:33:34,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:33:34,703 INFO L87 Difference]: Start difference. First operand 72 states and 104 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:34,732 INFO L93 Difference]: Finished difference Result 142 states and 207 transitions. [2024-11-16 15:33:34,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:33:34,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 110 [2024-11-16 15:33:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:34,735 INFO L225 Difference]: With dead ends: 142 [2024-11-16 15:33:34,736 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 15:33:34,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:33:34,738 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:34,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:33:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 15:33:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-16 15:33:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:33:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2024-11-16 15:33:34,753 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 110 [2024-11-16 15:33:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:34,755 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2024-11-16 15:33:34,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2024-11-16 15:33:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 15:33:34,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:34,757 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:34,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:33:34,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:34,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:34,758 INFO L85 PathProgramCache]: Analyzing trace with hash -878640952, now seen corresponding path program 1 times [2024-11-16 15:33:34,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:34,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281522258] [2024-11-16 15:33:34,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:34,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:33:36,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:36,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281522258] [2024-11-16 15:33:36,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281522258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:36,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:36,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 15:33:36,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020249599] [2024-11-16 15:33:36,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:36,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 15:33:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:36,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 15:33:36,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:33:36,538 INFO L87 Difference]: Start difference. First operand 73 states and 105 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:37,153 INFO L93 Difference]: Finished difference Result 225 states and 323 transitions. [2024-11-16 15:33:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:33:37,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 15:33:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:37,156 INFO L225 Difference]: With dead ends: 225 [2024-11-16 15:33:37,157 INFO L226 Difference]: Without dead ends: 155 [2024-11-16 15:33:37,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:33:37,158 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 129 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:37,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 458 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 15:33:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-16 15:33:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 99. [2024-11-16 15:33:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:33:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-11-16 15:33:37,171 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 111 [2024-11-16 15:33:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:37,171 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-11-16 15:33:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-11-16 15:33:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 15:33:37,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:37,173 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:37,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:33:37,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:37,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:37,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1287465177, now seen corresponding path program 1 times [2024-11-16 15:33:37,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:37,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759725422] [2024-11-16 15:33:37,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:37,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:33:38,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759725422] [2024-11-16 15:33:38,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759725422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:38,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:38,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 15:33:38,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213853990] [2024-11-16 15:33:38,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:38,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 15:33:38,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:38,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 15:33:38,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:33:38,655 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:39,153 INFO L93 Difference]: Finished difference Result 253 states and 365 transitions. [2024-11-16 15:33:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:33:39,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 15:33:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:39,155 INFO L225 Difference]: With dead ends: 253 [2024-11-16 15:33:39,157 INFO L226 Difference]: Without dead ends: 157 [2024-11-16 15:33:39,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 15:33:39,158 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 97 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:39,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 579 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 15:33:39,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-16 15:33:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2024-11-16 15:33:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:33:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-11-16 15:33:39,167 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 111 [2024-11-16 15:33:39,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:39,168 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-11-16 15:33:39,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-11-16 15:33:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 15:33:39,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:39,170 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:39,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 15:33:39,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:39,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1378270055, now seen corresponding path program 1 times [2024-11-16 15:33:39,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:39,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154045261] [2024-11-16 15:33:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:33:39,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:39,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154045261] [2024-11-16 15:33:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154045261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:39,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:39,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 15:33:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025837335] [2024-11-16 15:33:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:39,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 15:33:39,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:39,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 15:33:39,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:33:39,701 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:39,943 INFO L93 Difference]: Finished difference Result 253 states and 365 transitions. [2024-11-16 15:33:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:33:39,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 15:33:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:39,946 INFO L225 Difference]: With dead ends: 253 [2024-11-16 15:33:39,946 INFO L226 Difference]: Without dead ends: 157 [2024-11-16 15:33:39,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 15:33:39,948 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 129 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:39,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 642 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:33:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-16 15:33:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2024-11-16 15:33:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:33:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-11-16 15:33:39,960 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 111 [2024-11-16 15:33:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:39,960 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-11-16 15:33:39,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-11-16 15:33:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 15:33:39,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:39,965 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:39,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 15:33:39,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:39,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:39,965 INFO L85 PathProgramCache]: Analyzing trace with hash 969445830, now seen corresponding path program 1 times [2024-11-16 15:33:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:39,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456928952] [2024-11-16 15:33:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:39,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:33:40,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456928952] [2024-11-16 15:33:40,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456928952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:40,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:40,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 15:33:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536835283] [2024-11-16 15:33:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:40,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 15:33:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:40,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 15:33:40,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:33:40,546 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:41,003 INFO L93 Difference]: Finished difference Result 255 states and 367 transitions. [2024-11-16 15:33:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:33:41,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 15:33:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:41,006 INFO L225 Difference]: With dead ends: 255 [2024-11-16 15:33:41,006 INFO L226 Difference]: Without dead ends: 159 [2024-11-16 15:33:41,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:33:41,007 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 97 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:41,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 646 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:33:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-16 15:33:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2024-11-16 15:33:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:33:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2024-11-16 15:33:41,017 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 111 [2024-11-16 15:33:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:41,018 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2024-11-16 15:33:41,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2024-11-16 15:33:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 15:33:41,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:41,019 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:41,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 15:33:41,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:41,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1886025226, now seen corresponding path program 1 times [2024-11-16 15:33:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:41,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120766556] [2024-11-16 15:33:41,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:41,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:33:41,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:41,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120766556] [2024-11-16 15:33:41,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120766556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:41,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:41,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:33:41,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334473209] [2024-11-16 15:33:41,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:41,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:33:41,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:41,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:33:41,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:33:41,085 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:41,122 INFO L93 Difference]: Finished difference Result 214 states and 308 transitions. [2024-11-16 15:33:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:33:41,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2024-11-16 15:33:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:41,124 INFO L225 Difference]: With dead ends: 214 [2024-11-16 15:33:41,124 INFO L226 Difference]: Without dead ends: 142 [2024-11-16 15:33:41,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:33:41,125 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 85 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:41,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 171 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:33:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-16 15:33:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2024-11-16 15:33:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:33:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-16 15:33:41,130 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 113 [2024-11-16 15:33:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:41,130 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-16 15:33:41,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-16 15:33:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 15:33:41,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:41,131 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:41,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 15:33:41,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:41,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:41,132 INFO L85 PathProgramCache]: Analyzing trace with hash 209896200, now seen corresponding path program 1 times [2024-11-16 15:33:41,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:41,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576631672] [2024-11-16 15:33:41,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:33:41,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:41,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576631672] [2024-11-16 15:33:41,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576631672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:41,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:41,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 15:33:41,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405375476] [2024-11-16 15:33:41,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:41,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 15:33:41,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:41,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 15:33:41,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:33:41,732 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:42,112 INFO L93 Difference]: Finished difference Result 410 states and 580 transitions. [2024-11-16 15:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 15:33:42,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2024-11-16 15:33:42,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:42,114 INFO L225 Difference]: With dead ends: 410 [2024-11-16 15:33:42,114 INFO L226 Difference]: Without dead ends: 312 [2024-11-16 15:33:42,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:33:42,115 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 259 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:42,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 358 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:33:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-16 15:33:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 235. [2024-11-16 15:33:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 203 states have (on average 1.374384236453202) internal successors, (279), 205 states have internal predecessors, (279), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:33:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 335 transitions. [2024-11-16 15:33:42,127 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 335 transitions. Word has length 113 [2024-11-16 15:33:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:42,127 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 335 transitions. [2024-11-16 15:33:42,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 335 transitions. [2024-11-16 15:33:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 15:33:42,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:42,128 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:42,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 15:33:42,129 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:42,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:42,129 INFO L85 PathProgramCache]: Analyzing trace with hash -528082664, now seen corresponding path program 1 times [2024-11-16 15:33:42,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:42,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997633394] [2024-11-16 15:33:42,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:42,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 15:33:42,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997633394] [2024-11-16 15:33:42,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997633394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:33:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737532119] [2024-11-16 15:33:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:42,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:33:42,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:33:42,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:33:42,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 15:33:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:42,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 15:33:42,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:33:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-16 15:33:42,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:33:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 15:33:42,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737532119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:33:42,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 15:33:42,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-16 15:33:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058967154] [2024-11-16 15:33:42,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 15:33:42,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 15:33:42,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:42,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 15:33:42,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:33:42,706 INFO L87 Difference]: Start difference. First operand 235 states and 335 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-16 15:33:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:42,855 INFO L93 Difference]: Finished difference Result 489 states and 684 transitions. [2024-11-16 15:33:42,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 15:33:42,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 113 [2024-11-16 15:33:42,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:42,858 INFO L225 Difference]: With dead ends: 489 [2024-11-16 15:33:42,858 INFO L226 Difference]: Without dead ends: 257 [2024-11-16 15:33:42,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-16 15:33:42,859 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 166 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:42,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 166 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:33:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-16 15:33:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-11-16 15:33:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 218 states have (on average 1.3302752293577982) internal successors, (290), 220 states have internal predecessors, (290), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:33:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 346 transitions. [2024-11-16 15:33:42,870 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 346 transitions. Word has length 113 [2024-11-16 15:33:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:42,870 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 346 transitions. [2024-11-16 15:33:42,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-16 15:33:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 346 transitions. [2024-11-16 15:33:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 15:33:42,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:42,871 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:42,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 15:33:43,075 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-11-16 15:33:43,076 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:43,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1372554535, now seen corresponding path program 1 times [2024-11-16 15:33:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317223723] [2024-11-16 15:33:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:33:43,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420855976] [2024-11-16 15:33:43,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:43,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:33:43,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:33:43,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:33:43,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 15:33:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:43,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 15:33:43,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:33:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 15:33:43,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:33:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 15:33:44,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:44,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317223723] [2024-11-16 15:33:44,067 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 15:33:44,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420855976] [2024-11-16 15:33:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420855976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:33:44,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 15:33:44,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-11-16 15:33:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447081126] [2024-11-16 15:33:44,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 15:33:44,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 15:33:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:44,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 15:33:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-16 15:33:44,069 INFO L87 Difference]: Start difference. First operand 255 states and 346 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-16 15:33:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:44,804 INFO L93 Difference]: Finished difference Result 661 states and 862 transitions. [2024-11-16 15:33:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 15:33:44,804 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 113 [2024-11-16 15:33:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:44,806 INFO L225 Difference]: With dead ends: 661 [2024-11-16 15:33:44,807 INFO L226 Difference]: Without dead ends: 409 [2024-11-16 15:33:44,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2024-11-16 15:33:44,808 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 186 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:44,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 834 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 15:33:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-16 15:33:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 242. [2024-11-16 15:33:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 207 states have (on average 1.318840579710145) internal successors, (273), 208 states have internal predecessors, (273), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 15:33:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 325 transitions. [2024-11-16 15:33:44,825 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 325 transitions. Word has length 113 [2024-11-16 15:33:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:44,825 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 325 transitions. [2024-11-16 15:33:44,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-16 15:33:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 325 transitions. [2024-11-16 15:33:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 15:33:44,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:44,827 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:44,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 15:33:45,027 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-11-16 15:33:45,028 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:45,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1828160089, now seen corresponding path program 1 times [2024-11-16 15:33:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:45,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139472016] [2024-11-16 15:33:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:45,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:33:45,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:45,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139472016] [2024-11-16 15:33:45,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139472016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:45,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:45,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 15:33:45,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560022368] [2024-11-16 15:33:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:45,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 15:33:45,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:45,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 15:33:45,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:33:45,312 INFO L87 Difference]: Start difference. First operand 242 states and 325 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:45,557 INFO L93 Difference]: Finished difference Result 707 states and 928 transitions. [2024-11-16 15:33:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:33:45,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2024-11-16 15:33:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:45,562 INFO L225 Difference]: With dead ends: 707 [2024-11-16 15:33:45,562 INFO L226 Difference]: Without dead ends: 468 [2024-11-16 15:33:45,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:33:45,563 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 145 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:45,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 386 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:33:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-16 15:33:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 249. [2024-11-16 15:33:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 214 states have (on average 1.3224299065420562) internal successors, (283), 215 states have internal predecessors, (283), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 15:33:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 335 transitions. [2024-11-16 15:33:45,582 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 335 transitions. Word has length 113 [2024-11-16 15:33:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:45,582 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 335 transitions. [2024-11-16 15:33:45,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:45,583 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-11-16 15:33:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 15:33:45,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:45,583 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:45,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 15:33:45,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:45,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1450549635, now seen corresponding path program 1 times [2024-11-16 15:33:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:45,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258739541] [2024-11-16 15:33:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:33:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:33:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:33:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:33:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:33:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:33:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:33:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:33:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:33:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:33:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:33:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:33:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:33:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:33:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:33:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:33:45,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:33:45,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258739541] [2024-11-16 15:33:45,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258739541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:45,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:45,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:33:45,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611791871] [2024-11-16 15:33:45,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:45,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:33:45,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:33:45,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:33:45,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:33:45,647 INFO L87 Difference]: Start difference. First operand 249 states and 335 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:45,694 INFO L93 Difference]: Finished difference Result 580 states and 781 transitions. [2024-11-16 15:33:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:33:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-11-16 15:33:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:45,696 INFO L225 Difference]: With dead ends: 580 [2024-11-16 15:33:45,696 INFO L226 Difference]: Without dead ends: 334 [2024-11-16 15:33:45,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:33:45,697 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 29 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:45,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 167 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:33:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-16 15:33:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 267. [2024-11-16 15:33:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 232 states have (on average 1.3189655172413792) internal successors, (306), 233 states have internal predecessors, (306), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 15:33:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 358 transitions. [2024-11-16 15:33:45,709 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 358 transitions. Word has length 114 [2024-11-16 15:33:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:45,709 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 358 transitions. [2024-11-16 15:33:45,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:33:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 358 transitions. [2024-11-16 15:33:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 15:33:45,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:45,710 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:45,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 15:33:45,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:45,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1429025705, now seen corresponding path program 1 times [2024-11-16 15:33:45,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:33:45,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282000859] [2024-11-16 15:33:45,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:45,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:33:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:33:45,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039134431] [2024-11-16 15:33:45,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:45,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:33:45,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:33:45,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:33:45,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 15:33:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:33:46,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:33:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:33:46,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:33:46,273 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:33:46,274 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:33:46,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 15:33:46,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:33:46,482 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:46,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:33:46,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:33:46 BoogieIcfgContainer [2024-11-16 15:33:46,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:33:46,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:33:46,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:33:46,538 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:33:46,538 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:33:33" (3/4) ... [2024-11-16 15:33:46,540 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:33:46,540 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:33:46,541 INFO L158 Benchmark]: Toolchain (without parser) took 13359.38ms. Allocated memory was 169.9MB in the beginning and 377.5MB in the end (delta: 207.6MB). Free memory was 136.5MB in the beginning and 266.2MB in the end (delta: -129.7MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2024-11-16 15:33:46,541 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory was 139.1MB in the beginning and 139.0MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:33:46,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.32ms. Allocated memory is still 169.9MB. Free memory was 136.0MB in the beginning and 120.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 15:33:46,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.53ms. Allocated memory is still 169.9MB. Free memory was 120.9MB in the beginning and 117.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:33:46,542 INFO L158 Benchmark]: Boogie Preprocessor took 42.44ms. Allocated memory is still 169.9MB. Free memory was 117.9MB in the beginning and 115.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:33:46,542 INFO L158 Benchmark]: IcfgBuilder took 401.56ms. Allocated memory is still 169.9MB. Free memory was 115.0MB in the beginning and 92.7MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 15:33:46,542 INFO L158 Benchmark]: TraceAbstraction took 12606.27ms. Allocated memory was 169.9MB in the beginning and 377.5MB in the end (delta: 207.6MB). Free memory was 92.0MB in the beginning and 266.2MB in the end (delta: -174.2MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-11-16 15:33:46,542 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 377.5MB. Free memory is still 266.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:33:46,544 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.15ms. Allocated memory is still 169.9MB. Free memory was 139.1MB in the beginning and 139.0MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.32ms. Allocated memory is still 169.9MB. Free memory was 136.0MB in the beginning and 120.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.53ms. Allocated memory is still 169.9MB. Free memory was 120.9MB in the beginning and 117.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.44ms. Allocated memory is still 169.9MB. Free memory was 117.9MB in the beginning and 115.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 401.56ms. Allocated memory is still 169.9MB. Free memory was 115.0MB in the beginning and 92.7MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12606.27ms. Allocated memory was 169.9MB in the beginning and 377.5MB in the end (delta: 207.6MB). Free memory was 92.0MB in the beginning and 266.2MB in the end (delta: -174.2MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 377.5MB. Free memory is still 266.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=3, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=3, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=3, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=3, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=3, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=3, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=3, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=3, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=3, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L127] RET updateVariables() [L128] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=3, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=3, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=3, stepLocal_4=3, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=3, stepLocal_4=3, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=3, stepLocal_4=3, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=3, stepLocal_4=3, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=3, stepLocal_4=3, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=3, var_1_11=3, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=3, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=4, var_1_6=12, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1328 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1322 mSDsluCounter, 4695 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3393 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3003 IncrementalHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 1302 mSDtfsCounter, 3003 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 903 GetRequests, 812 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=12, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 829 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1797 NumberOfCodeBlocks, 1797 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1667 ConstructedInterpolants, 0 QuantifiedInterpolants, 5886 SizeOfPredicates, 8 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 6114/6300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 15:33:46,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:33:48,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:33:48,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:33:48,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:33:48,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:33:48,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:33:48,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:33:48,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:33:48,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:33:48,440 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:33:48,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:33:48,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:33:48,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:33:48,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:33:48,441 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:33:48,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:33:48,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:33:48,441 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:33:48,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:33:48,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:33:48,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:33:48,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:33:48,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:33:48,443 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:33:48,444 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:33:48,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:33:48,444 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:33:48,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:33:48,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:33:48,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:33:48,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:33:48,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:33:48,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:33:48,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:33:48,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:33:48,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:33:48,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:33:48,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:33:48,446 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:33:48,446 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:33:48,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:33:48,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:33:48,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:33:48,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:33:48,447 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 -> d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d [2024-11-16 15:33:48,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:33:48,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:33:48,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:33:48,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:33:48,700 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:33:48,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-16 15:33:49,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:33:50,103 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:33:50,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-16 15:33:50,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a4a8067/0fb8775e855c4ab78e46dc692f2e31a8/FLAG8be1e3f2c [2024-11-16 15:33:50,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a4a8067/0fb8775e855c4ab78e46dc692f2e31a8 [2024-11-16 15:33:50,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:33:50,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:33:50,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:33:50,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:33:50,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:33:50,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d785f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50, skipping insertion in model container [2024-11-16 15:33:50,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:33:50,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i[912,925] [2024-11-16 15:33:50,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:33:50,363 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:33:50,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i[912,925] [2024-11-16 15:33:50,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:33:50,431 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:33:50,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50 WrapperNode [2024-11-16 15:33:50,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:33:50,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:33:50,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:33:50,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:33:50,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,501 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-16 15:33:50,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:33:50,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:33:50,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:33:50,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:33:50,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,530 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:33:50,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:33:50,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:33:50,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:33:50,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:33:50,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (1/1) ... [2024-11-16 15:33:50,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:33:50,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:33:50,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:33:50,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:33:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:33:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:33:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:33:50,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:33:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:33:50,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:33:50,694 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:33:50,696 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:33:50,967 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 15:33:50,967 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:33:50,981 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:33:50,982 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:33:50,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:33:50 BoogieIcfgContainer [2024-11-16 15:33:50,982 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:33:50,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:33:50,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:33:50,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:33:50,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:33:50" (1/3) ... [2024-11-16 15:33:50,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274dd46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:33:50, skipping insertion in model container [2024-11-16 15:33:50,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:33:50" (2/3) ... [2024-11-16 15:33:50,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274dd46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:33:50, skipping insertion in model container [2024-11-16 15:33:50,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:33:50" (3/3) ... [2024-11-16 15:33:50,987 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-16 15:33:50,998 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:33:50,998 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:33:51,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:33:51,059 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;@301e048f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:33:51,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:33:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:33:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 15:33:51,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:51,072 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:51,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1555997321, now seen corresponding path program 1 times [2024-11-16 15:33:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:33:51,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704367688] [2024-11-16 15:33:51,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:51,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:33:51,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:33:51,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:33:51,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 15:33:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:51,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:33:51,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:33:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-16 15:33:51,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:33:51,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:33:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704367688] [2024-11-16 15:33:51,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704367688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:33:51,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:33:51,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:33:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204160306] [2024-11-16 15:33:51,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:33:51,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:33:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:33:51,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:33:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:33:51,353 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 15:33:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:33:51,379 INFO L93 Difference]: Finished difference Result 108 states and 178 transitions. [2024-11-16 15:33:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:33:51,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2024-11-16 15:33:51,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:33:51,387 INFO L225 Difference]: With dead ends: 108 [2024-11-16 15:33:51,388 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 15:33:51,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:33:51,395 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:33:51,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:33:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 15:33:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 15:33:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:33:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-16 15:33:51,431 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 102 [2024-11-16 15:33:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:33:51,432 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-16 15:33:51,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 15:33:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-16 15:33:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 15:33:51,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:33:51,437 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:33:51,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 15:33:51,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:33:51,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:33:51,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:33:51,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1130143131, now seen corresponding path program 1 times [2024-11-16 15:33:51,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:33:51,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098476364] [2024-11-16 15:33:51,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:33:51,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:33:51,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:33:51,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:33:51,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 15:33:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:33:51,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 15:33:51,815 INFO L278 TraceCheckSpWp]: Computing forward predicates...