./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_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_codestructure_functionizing_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 b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:11:52,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:11:52,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:11:52,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:11:52,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:11:52,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:11:52,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:11:52,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:11:52,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:11:52,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:11:52,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:11:52,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:11:52,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:11:52,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:11:52,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:11:52,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:11:52,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:11:52,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:11:52,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:11:52,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:11:52,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:11:52,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:11:52,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:11:52,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:11:52,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:11:52,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:11:52,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:11:52,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:11:52,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:11:52,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:11:52,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:11:52,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:11:52,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:11:52,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:11:52,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:11:52,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:11:52,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:11:52,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:11:52,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:11:52,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:11:52,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:11:52,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:11:52,496 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be [2024-11-16 12:11:52,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:11:52,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:11:52,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:11:52,693 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:11:52,693 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:11:52,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-16 12:11:53,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:11:54,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:11:54,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-16 12:11:54,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e070f92bc/c7ab0b8f8e304b35b5b3466cff3e6d2b/FLAGda966e38b [2024-11-16 12:11:54,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e070f92bc/c7ab0b8f8e304b35b5b3466cff3e6d2b [2024-11-16 12:11:54,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:11:54,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:11:54,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:11:54,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:11:54,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:11:54,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6755207e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54, skipping insertion in model container [2024-11-16 12:11:54,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:11:54,244 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_codestructure_functionizing_file-9.i[919,932] [2024-11-16 12:11:54,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:11:54,291 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:11:54,300 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_codestructure_functionizing_file-9.i[919,932] [2024-11-16 12:11:54,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:11:54,344 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:11:54,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54 WrapperNode [2024-11-16 12:11:54,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:11:54,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:11:54,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:11:54,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:11:54,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,383 INFO L138 Inliner]: procedures = 30, calls = 38, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 215 [2024-11-16 12:11:54,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:11:54,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:11:54,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:11:54,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:11:54,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,405 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 12:11:54,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,410 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:11:54,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:11:54,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:11:54,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:11:54,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (1/1) ... [2024-11-16 12:11:54,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:11:54,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:11:54,453 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 12:11:54,455 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 12:11:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:11:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:11:54,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:11:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:11:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:11:54,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:11:54,546 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:11:54,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:11:54,815 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc functionized0_#t~bitwise15#1; [2024-11-16 12:11:54,816 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc property_#t~bitwise32#1;havoc property_#t~ite34#1;havoc property_#t~bitwise33#1;havoc property_#t~bitwise35#1;havoc property_#t~short36#1; [2024-11-16 12:11:54,842 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-16 12:11:54,843 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:11:54,866 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:11:54,866 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:11:54,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:11:54 BoogieIcfgContainer [2024-11-16 12:11:54,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:11:54,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:11:54,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:11:54,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:11:54,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:11:54" (1/3) ... [2024-11-16 12:11:54,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b34e37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:54, skipping insertion in model container [2024-11-16 12:11:54,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:54" (2/3) ... [2024-11-16 12:11:54,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b34e37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:54, skipping insertion in model container [2024-11-16 12:11:54,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:11:54" (3/3) ... [2024-11-16 12:11:54,875 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-9.i [2024-11-16 12:11:54,888 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:11:54,889 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:11:54,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:11:54,935 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;@1f10da2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:11:54,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:11:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 64 states have (on average 1.359375) internal successors, (87), 65 states have internal predecessors, (87), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 12:11:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 12:11:54,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:11:54,953 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:54,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:11:54,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:11:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1561726399, now seen corresponding path program 1 times [2024-11-16 12:11:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:11:54,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660491016] [2024-11-16 12:11:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:11:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:11:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:11:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:11:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:11:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:11:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:11:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:11:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:11:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:11:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:11:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:11:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:11:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:11:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:11:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:11:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:11:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:11:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:11:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:11:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:11:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:11:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:11:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 12:11:55,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:11:55,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660491016] [2024-11-16 12:11:55,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660491016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:11:55,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:11:55,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:11:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005117429] [2024-11-16 12:11:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:11:55,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:11:55,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:11:55,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:11:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:11:55,327 INFO L87 Difference]: Start difference. First operand has 88 states, 64 states have (on average 1.359375) internal successors, (87), 65 states have internal predecessors, (87), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 12:11:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:11:55,361 INFO L93 Difference]: Finished difference Result 168 states and 272 transitions. [2024-11-16 12:11:55,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:11:55,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 141 [2024-11-16 12:11:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:11:55,386 INFO L225 Difference]: With dead ends: 168 [2024-11-16 12:11:55,386 INFO L226 Difference]: Without dead ends: 83 [2024-11-16 12:11:55,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 12:11:55,392 INFO L432 NwaCegarLoop]: 115 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, 115 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 12:11:55,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:11:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-16 12:11:55,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-16 12:11:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 12:11:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-11-16 12:11:55,453 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 141 [2024-11-16 12:11:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:11:55,454 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-11-16 12:11:55,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 12:11:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-11-16 12:11:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 12:11:55,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:11:55,456 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:55,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:11:55,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:11:55,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:11:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1769918338, now seen corresponding path program 1 times [2024-11-16 12:11:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:11:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688265394] [2024-11-16 12:11:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:11:55,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:11:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:11:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:11:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:11:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:11:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:11:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:11:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:11:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:11:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:11:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:11:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:11:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:11:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:11:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:11:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:11:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:11:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:11:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:11:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:11:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:11:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:11:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 12:11:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:11:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688265394] [2024-11-16 12:11:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688265394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:11:55,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:11:55,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:11:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530476602] [2024-11-16 12:11:55,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:11:55,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:11:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:11:55,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:11:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:11:55,691 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:11:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:11:55,735 INFO L93 Difference]: Finished difference Result 164 states and 241 transitions. [2024-11-16 12:11:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:11:55,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-11-16 12:11:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:11:55,738 INFO L225 Difference]: With dead ends: 164 [2024-11-16 12:11:55,738 INFO L226 Difference]: Without dead ends: 84 [2024-11-16 12:11:55,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:11:55,741 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 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 12:11:55,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:11:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-16 12:11:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-16 12:11:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 12:11:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-11-16 12:11:55,751 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 141 [2024-11-16 12:11:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:11:55,752 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-11-16 12:11:55,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:11:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-11-16 12:11:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 12:11:55,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:11:55,754 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:55,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:11:55,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:11:55,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:11:55,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1708764953, now seen corresponding path program 1 times [2024-11-16 12:11:55,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:11:55,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435189594] [2024-11-16 12:11:55,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:11:55,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:11:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:11:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:11:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:11:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:11:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:11:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:11:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:11:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:11:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:11:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:11:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:11:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:11:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:11:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:11:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:11:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:11:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:11:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:11:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:11:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:11:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:11:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:11:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 12:11:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:11:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435189594] [2024-11-16 12:11:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435189594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:11:59,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:11:59,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:11:59,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205079132] [2024-11-16 12:11:59,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:11:59,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:11:59,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:11:59,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:11:59,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:11:59,358 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:02,123 INFO L93 Difference]: Finished difference Result 334 states and 462 transitions. [2024-11-16 12:12:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:12:02,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-16 12:12:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:02,126 INFO L225 Difference]: With dead ends: 334 [2024-11-16 12:12:02,126 INFO L226 Difference]: Without dead ends: 253 [2024-11-16 12:12:02,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-16 12:12:02,128 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 302 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:02,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1075 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-16 12:12:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-16 12:12:02,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 183. [2024-11-16 12:12:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 152 states have (on average 1.355263157894737) internal successors, (206), 154 states have internal predecessors, (206), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 12:12:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 260 transitions. [2024-11-16 12:12:02,150 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 260 transitions. Word has length 142 [2024-11-16 12:12:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:02,150 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 260 transitions. [2024-11-16 12:12:02,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 260 transitions. [2024-11-16 12:12:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 12:12:02,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:02,155 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:02,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:12:02,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:02,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash -355455256, now seen corresponding path program 1 times [2024-11-16 12:12:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:02,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817204637] [2024-11-16 12:12:02,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:12:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:12:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:12:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 12:12:02,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:02,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817204637] [2024-11-16 12:12:02,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817204637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:02,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:02,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:12:02,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438444366] [2024-11-16 12:12:02,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:02,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:12:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:02,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:12:02,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:12:02,674 INFO L87 Difference]: Start difference. First operand 183 states and 260 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:02,960 INFO L93 Difference]: Finished difference Result 398 states and 559 transitions. [2024-11-16 12:12:02,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:12:02,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-16 12:12:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:02,964 INFO L225 Difference]: With dead ends: 398 [2024-11-16 12:12:02,964 INFO L226 Difference]: Without dead ends: 218 [2024-11-16 12:12:02,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:12:02,969 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 110 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:02,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 769 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:12:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-16 12:12:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 186. [2024-11-16 12:12:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 155 states have (on average 1.3548387096774193) internal successors, (210), 157 states have internal predecessors, (210), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 12:12:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2024-11-16 12:12:02,999 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 142 [2024-11-16 12:12:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:02,999 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2024-11-16 12:12:02,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2024-11-16 12:12:03,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 12:12:03,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:03,004 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:03,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:12:03,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:03,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:03,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1589129990, now seen corresponding path program 1 times [2024-11-16 12:12:03,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:03,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848447364] [2024-11-16 12:12:03,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:03,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:12:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:12:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:12:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 12:12:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848447364] [2024-11-16 12:12:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848447364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:03,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:03,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:12:03,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249828327] [2024-11-16 12:12:03,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:03,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:12:03,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:03,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:12:03,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:12:03,842 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:04,511 INFO L93 Difference]: Finished difference Result 425 states and 595 transitions. [2024-11-16 12:12:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:12:04,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-16 12:12:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:04,513 INFO L225 Difference]: With dead ends: 425 [2024-11-16 12:12:04,514 INFO L226 Difference]: Without dead ends: 242 [2024-11-16 12:12:04,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:12:04,515 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 123 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:04,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 571 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:12:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-16 12:12:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 213. [2024-11-16 12:12:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 179 states have (on average 1.3575418994413408) internal successors, (243), 182 states have internal predecessors, (243), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 12:12:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 301 transitions. [2024-11-16 12:12:04,530 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 301 transitions. Word has length 142 [2024-11-16 12:12:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:04,530 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 301 transitions. [2024-11-16 12:12:04,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 301 transitions. [2024-11-16 12:12:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 12:12:04,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:04,532 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:04,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:12:04,532 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:04,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1352527609, now seen corresponding path program 1 times [2024-11-16 12:12:04,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:04,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532095336] [2024-11-16 12:12:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:12:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:12:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:12:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 12:12:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:05,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532095336] [2024-11-16 12:12:05,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532095336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:05,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:05,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:12:05,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930742311] [2024-11-16 12:12:05,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:05,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:12:05,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:05,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:12:05,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:12:05,195 INFO L87 Difference]: Start difference. First operand 213 states and 301 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:06,061 INFO L93 Difference]: Finished difference Result 449 states and 627 transitions. [2024-11-16 12:12:06,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:12:06,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-16 12:12:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:06,063 INFO L225 Difference]: With dead ends: 449 [2024-11-16 12:12:06,063 INFO L226 Difference]: Without dead ends: 244 [2024-11-16 12:12:06,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:12:06,064 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 98 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:06,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 738 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 12:12:06,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-16 12:12:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 197. [2024-11-16 12:12:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 163 states have (on average 1.3374233128834356) internal successors, (218), 166 states have internal predecessors, (218), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 12:12:06,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 276 transitions. [2024-11-16 12:12:06,077 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 276 transitions. Word has length 142 [2024-11-16 12:12:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:06,077 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 276 transitions. [2024-11-16 12:12:06,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 276 transitions. [2024-11-16 12:12:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 12:12:06,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:06,079 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:06,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 12:12:06,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:06,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:06,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1086271041, now seen corresponding path program 1 times [2024-11-16 12:12:06,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:06,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008289529] [2024-11-16 12:12:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:12:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:12:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:12:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 12:12:06,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008289529] [2024-11-16 12:12:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008289529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:06,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:06,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:12:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388623363] [2024-11-16 12:12:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:06,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:12:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:06,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:12:06,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:12:06,970 INFO L87 Difference]: Start difference. First operand 197 states and 276 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:07,313 INFO L93 Difference]: Finished difference Result 422 states and 585 transitions. [2024-11-16 12:12:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:12:07,313 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-16 12:12:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:07,315 INFO L225 Difference]: With dead ends: 422 [2024-11-16 12:12:07,315 INFO L226 Difference]: Without dead ends: 233 [2024-11-16 12:12:07,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:12:07,316 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 107 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:07,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 513 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:12:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-16 12:12:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 198. [2024-11-16 12:12:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 164 states have (on average 1.329268292682927) internal successors, (218), 167 states have internal predecessors, (218), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 12:12:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 276 transitions. [2024-11-16 12:12:07,328 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 276 transitions. Word has length 143 [2024-11-16 12:12:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:07,329 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 276 transitions. [2024-11-16 12:12:07,329 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 276 transitions. [2024-11-16 12:12:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 12:12:07,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:07,330 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:07,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:12:07,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:07,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:07,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1324648295, now seen corresponding path program 1 times [2024-11-16 12:12:07,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:07,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597266487] [2024-11-16 12:12:07,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:07,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:12:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:12:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:12:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 12:12:07,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:07,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597266487] [2024-11-16 12:12:07,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597266487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:07,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:07,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:12:07,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223978660] [2024-11-16 12:12:07,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:07,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:12:07,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:07,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:12:07,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:12:07,924 INFO L87 Difference]: Start difference. First operand 198 states and 276 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:08,127 INFO L93 Difference]: Finished difference Result 513 states and 718 transitions. [2024-11-16 12:12:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:12:08,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-16 12:12:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:08,130 INFO L225 Difference]: With dead ends: 513 [2024-11-16 12:12:08,130 INFO L226 Difference]: Without dead ends: 323 [2024-11-16 12:12:08,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:12:08,131 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 42 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:08,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 345 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:12:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-16 12:12:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 260. [2024-11-16 12:12:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 226 states have (on average 1.3893805309734513) internal successors, (314), 229 states have internal predecessors, (314), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 12:12:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 372 transitions. [2024-11-16 12:12:08,147 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 372 transitions. Word has length 144 [2024-11-16 12:12:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:08,147 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 372 transitions. [2024-11-16 12:12:08,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 372 transitions. [2024-11-16 12:12:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 12:12:08,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:08,149 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:08,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:12:08,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:08,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2138661846, now seen corresponding path program 1 times [2024-11-16 12:12:08,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:08,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001069325] [2024-11-16 12:12:08,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:12:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:12:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:12:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 12:12:08,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:08,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001069325] [2024-11-16 12:12:08,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001069325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:08,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:08,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:12:08,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155620730] [2024-11-16 12:12:08,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:08,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:12:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:08,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:12:08,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:12:08,225 INFO L87 Difference]: Start difference. First operand 260 states and 372 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:08,258 INFO L93 Difference]: Finished difference Result 599 states and 858 transitions. [2024-11-16 12:12:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:12:08,259 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-16 12:12:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:08,261 INFO L225 Difference]: With dead ends: 599 [2024-11-16 12:12:08,261 INFO L226 Difference]: Without dead ends: 347 [2024-11-16 12:12:08,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:12:08,262 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 48 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:08,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 229 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:12:08,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-16 12:12:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 305. [2024-11-16 12:12:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 271 states have (on average 1.4132841328413284) internal successors, (383), 274 states have internal predecessors, (383), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 12:12:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 441 transitions. [2024-11-16 12:12:08,276 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 441 transitions. Word has length 144 [2024-11-16 12:12:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:08,276 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 441 transitions. [2024-11-16 12:12:08,276 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 12:12:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 441 transitions. [2024-11-16 12:12:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 12:12:08,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:08,277 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:08,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 12:12:08,278 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:08,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:08,278 INFO L85 PathProgramCache]: Analyzing trace with hash 380840259, now seen corresponding path program 1 times [2024-11-16 12:12:08,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:08,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470280003] [2024-11-16 12:12:08,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:08,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:12:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:12:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:12:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:12:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:12:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:12:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:12:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:12:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:12:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:12:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:12:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:12:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:12:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:12:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:12:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:12:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:12:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:12:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:12:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:12:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:12:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-16 12:12:08,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:12:08,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470280003] [2024-11-16 12:12:08,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470280003] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:12:08,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106536042] [2024-11-16 12:12:08,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:08,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:12:08,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:12:08,561 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 12:12:08,562 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 12:12:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:08,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 12:12:08,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:12:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 456 proven. 54 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-16 12:12:08,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:12:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-16 12:12:09,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106536042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:12:09,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:12:09,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 22 [2024-11-16 12:12:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267766719] [2024-11-16 12:12:09,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:12:09,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-16 12:12:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:12:09,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-16 12:12:09,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2024-11-16 12:12:09,327 INFO L87 Difference]: Start difference. First operand 305 states and 441 transitions. Second operand has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (58), 6 states have call predecessors, (58), 6 states have call successors, (58) [2024-11-16 12:12:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:09,951 INFO L93 Difference]: Finished difference Result 631 states and 895 transitions. [2024-11-16 12:12:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-16 12:12:09,951 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (58), 6 states have call predecessors, (58), 6 states have call successors, (58) Word has length 145 [2024-11-16 12:12:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:09,953 INFO L225 Difference]: With dead ends: 631 [2024-11-16 12:12:09,953 INFO L226 Difference]: Without dead ends: 334 [2024-11-16 12:12:09,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2024-11-16 12:12:09,955 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 226 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:09,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 584 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:12:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-16 12:12:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 250. [2024-11-16 12:12:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 217 states have (on average 1.3502304147465438) internal successors, (293), 218 states have internal predecessors, (293), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 12:12:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 343 transitions. [2024-11-16 12:12:09,968 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 343 transitions. Word has length 145 [2024-11-16 12:12:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:09,969 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 343 transitions. [2024-11-16 12:12:09,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (58), 6 states have call predecessors, (58), 6 states have call successors, (58) [2024-11-16 12:12:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 343 transitions. [2024-11-16 12:12:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 12:12:09,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:09,970 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:09,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 12:12:10,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 12:12:10,171 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:10,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:10,172 INFO L85 PathProgramCache]: Analyzing trace with hash -129693918, now seen corresponding path program 1 times [2024-11-16 12:12:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:12:10,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972836227] [2024-11-16 12:12:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:12:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:12:10,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [133947259] [2024-11-16 12:12:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:10,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:12:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:12:10,217 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 12:12:10,218 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 12:12:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:12:10,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:12:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:12:10,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:12:10,445 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:12:10,446 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:12:10,455 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 12:12:10,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 12:12:10,651 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:12:10,724 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:12:10,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:12:10 BoogieIcfgContainer [2024-11-16 12:12:10,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:12:10,727 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:12:10,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:12:10,727 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:12:10,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:11:54" (3/4) ... [2024-11-16 12:12:10,729 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:12:10,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:12:10,730 INFO L158 Benchmark]: Toolchain (without parser) took 16634.94ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 148.9MB in the beginning and 253.1MB in the end (delta: -104.2MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2024-11-16 12:12:10,730 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:12:10,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.13ms. Allocated memory is still 178.3MB. Free memory was 148.2MB in the beginning and 132.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 12:12:10,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.75ms. Allocated memory is still 178.3MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:12:10,730 INFO L158 Benchmark]: Boogie Preprocessor took 38.02ms. Allocated memory is still 178.3MB. Free memory was 130.4MB in the beginning and 127.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:12:10,730 INFO L158 Benchmark]: IcfgBuilder took 443.99ms. Allocated memory is still 178.3MB. Free memory was 127.2MB in the beginning and 102.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 12:12:10,731 INFO L158 Benchmark]: TraceAbstraction took 15857.39ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 101.0MB in the beginning and 254.2MB in the end (delta: -153.2MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-11-16 12:12:10,733 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 373.3MB. Free memory was 254.2MB in the beginning and 253.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:12:10,734 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.14ms. Allocated memory is still 125.8MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.13ms. Allocated memory is still 178.3MB. Free memory was 148.2MB in the beginning and 132.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.75ms. Allocated memory is still 178.3MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.02ms. Allocated memory is still 178.3MB. Free memory was 130.4MB in the beginning and 127.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 443.99ms. Allocated memory is still 178.3MB. Free memory was 127.2MB in the beginning and 102.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15857.39ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 101.0MB in the beginning and 254.2MB in the end (delta: -153.2MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 373.3MB. Free memory was 254.2MB in the beginning and 253.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 136. Possible FailurePath: [L25] unsigned char isInitial = 0; [L26] double var_1_1 = 5.5; [L27] signed char var_1_2 = 100; [L28] signed short int var_1_3 = 1; [L29] signed long int var_1_4 = -16; [L30] signed long int var_1_5 = -64; [L31] signed char var_1_6 = 10; [L32] signed char var_1_7 = 5; [L33] double var_1_8 = 16.25; [L34] double var_1_9 = 1.8; [L35] unsigned char var_1_10 = 32; [L36] unsigned char var_1_11 = 64; [L37] unsigned short int var_1_12 = 16; [L38] unsigned long int var_1_13 = 128; [L39] unsigned char var_1_15 = 1; [L40] unsigned short int var_1_16 = 256; [L41] unsigned short int var_1_17 = 8; [L42] signed char var_1_18 = -2; VAL [isInitial=0, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=100, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L100] var_1_2 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L103] var_1_3 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L104] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L106] var_1_4 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L107] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L108] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L108] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L109] var_1_5 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L110] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L111] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L111] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L113] var_1_6 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L114] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] var_1_7 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L117] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L118] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L118] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L119] var_1_8 = __VERIFIER_nondet_double() [L120] 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_9=9/5] [L120] 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_9=9/5] [L121] var_1_9 = __VERIFIER_nondet_double() [L122] 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L122] 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, 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_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L123] var_1_11 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L124] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L125] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L125] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L126] var_1_15 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L127] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L128] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L128] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32, var_1_11=-2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L129] var_1_17 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, 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_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, 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_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L130] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=-2, 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_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L131] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, 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_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-2, 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_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L131] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=32, var_1_11=-2, 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_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L144] RET updateVariables() [L145] CALL step() [L72] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=-2, 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_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L72] COND FALSE !((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) [L79] COND TRUE var_1_6 <= (var_1_4 + var_1_7) [L80] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=-2, var_1_11=-2, 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_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L84] COND TRUE ((var_1_6 >> 2) * var_1_10) > var_1_4 [L85] var_1_12 = var_1_6 VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L87] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L87] COND TRUE (1 << var_1_2) != (-500 / -100) [L88] CALL, EXPR functionized2(var_1_6, var_1_3) [L50] return (functionized2_localFunctionVar0 - functionized2_localFunctionVar1); VAL [\result=10, isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L88] RET, EXPR functionized2(var_1_6, var_1_3) [L88] COND FALSE !((functionized2(var_1_6, var_1_3)) >= (var_1_10 + 256)) [L91] var_1_13 = var_1_12 VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=11, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6] [L96] CALL functionized3(var_1_17, var_1_8, var_1_10, var_1_9, var_1_15, 256) [L53] COND FALSE !((- functionized3_localFunctionVar3) <= functionized3_localFunctionVar1) [L66] var_1_16 = functionized3_localFunctionVar2 VAL [functionized3_localFunctionVar0=22, functionized3_localFunctionVar4=1, isInitial=1, localFunctionVar5=256, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=11, var_1_15=1, var_1_16=254, var_1_17=22, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=3, var_1_9=2] [L96] RET functionized3(var_1_17, var_1_8, var_1_10, var_1_9, var_1_15, 256) [L97] var_1_18 = var_1_3 VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=11, var_1_15=1, var_1_16=254, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=3, var_1_9=2] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=11, var_1_15=1, var_1_16=254, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR ((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 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, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=11, var_1_15=1, var_1_16=254, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 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 <= (var_1_4 + 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) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 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, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=11, var_1_15=1, var_1_16=254, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=11, var_1_15=1, var_1_16=254, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 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 <= (var_1_4 + 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) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 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, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=11, var_1_15=1, var_1_16=254, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=3, var_1_9=2] [L136-L137] return (((((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 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 <= (var_1_4 + 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) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 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_2) ? ((var_1_17 == 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)) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=11, var_1_15=1, var_1_16=254, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=3, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=-2, var_1_11=-2, var_1_12=11, var_1_13=11, var_1_15=1, var_1_16=254, var_1_17=22, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=5, var_1_5=2, var_1_6=11, var_1_7=6, var_1_8=3, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 11, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1060 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1056 mSDsluCounter, 5163 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3856 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2751 IncrementalHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 1307 mSDtfsCounter, 2751 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 831 GetRequests, 751 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=9, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 402 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 1861 NumberOfCodeBlocks, 1861 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1704 ConstructedInterpolants, 0 QuantifiedInterpolants, 6309 SizeOfPredicates, 6 NumberOfNonLiveVariables, 358 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 9918/10080 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 12:12:10,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_codestructure_functionizing_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 b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:12:12,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:12:12,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:12:12,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:12:12,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:12:12,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:12:12,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:12:12,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:12:12,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:12:12,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:12:12,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:12:12,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:12:12,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:12:12,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:12:12,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:12:12,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:12:12,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:12:12,617 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:12:12,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:12:12,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:12:12,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:12:12,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:12:12,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:12:12,621 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:12:12,621 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:12:12,622 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:12:12,622 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:12:12,622 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:12:12,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:12:12,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:12:12,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:12:12,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:12:12,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:12:12,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:12:12,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:12:12,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:12:12,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:12:12,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:12:12,624 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:12:12,624 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:12:12,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:12:12,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:12:12,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:12:12,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:12:12,625 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 -> b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be [2024-11-16 12:12:12,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:12:12,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:12:12,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:12:12,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:12:12,894 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:12:12,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-16 12:12:14,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:12:14,302 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:12:14,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-16 12:12:14,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8a4af7d/1536a652f4214339a4746c9f9f3be68f/FLAGfc3934607 [2024-11-16 12:12:14,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8a4af7d/1536a652f4214339a4746c9f9f3be68f [2024-11-16 12:12:14,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:12:14,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:12:14,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:12:14,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:12:14,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:12:14,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118e94b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14, skipping insertion in model container [2024-11-16 12:12:14,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:12:14,510 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_codestructure_functionizing_file-9.i[919,932] [2024-11-16 12:12:14,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:12:14,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:12:14,599 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_codestructure_functionizing_file-9.i[919,932] [2024-11-16 12:12:14,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:12:14,645 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:12:14,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14 WrapperNode [2024-11-16 12:12:14,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:12:14,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:12:14,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:12:14,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:12:14,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,697 INFO L138 Inliner]: procedures = 31, calls = 38, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 154 [2024-11-16 12:12:14,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:12:14,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:12:14,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:12:14,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:12:14,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,731 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 12:12:14,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:12:14,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:12:14,754 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:12:14,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:12:14,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (1/1) ... [2024-11-16 12:12:14,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:12:14,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:12:14,781 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 12:12:14,783 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 12:12:14,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:12:14,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:12:14,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:12:14,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:12:14,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:12:14,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:12:14,880 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:12:14,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:12:15,185 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-16 12:12:15,186 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:12:15,197 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:12:15,198 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:12:15,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:12:15 BoogieIcfgContainer [2024-11-16 12:12:15,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:12:15,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:12:15,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:12:15,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:12:15,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:12:14" (1/3) ... [2024-11-16 12:12:15,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec0d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:15, skipping insertion in model container [2024-11-16 12:12:15,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:14" (2/3) ... [2024-11-16 12:12:15,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec0d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:15, skipping insertion in model container [2024-11-16 12:12:15,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:12:15" (3/3) ... [2024-11-16 12:12:15,206 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-9.i [2024-11-16 12:12:15,218 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:12:15,219 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:12:15,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:12:15,274 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;@136950ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:12:15,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:12:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 12:12:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 12:12:15,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:15,285 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:15,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:15,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:15,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1713420836, now seen corresponding path program 1 times [2024-11-16 12:12:15,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:12:15,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870412704] [2024-11-16 12:12:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:15,300 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 12:12:15,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:12:15,303 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 12:12:15,303 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 12:12:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:15,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:12:15,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:12:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-16 12:12:15,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:12:15,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:12:15,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870412704] [2024-11-16 12:12:15,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870412704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:12:15,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:12:15,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:12:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513982931] [2024-11-16 12:12:15,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:12:15,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:12:15,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:12:15,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:12:15,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:12:15,562 INFO L87 Difference]: Start difference. First operand has 69 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 12:12:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:15,587 INFO L93 Difference]: Finished difference Result 130 states and 218 transitions. [2024-11-16 12:12:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:12:15,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2024-11-16 12:12:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:15,594 INFO L225 Difference]: With dead ends: 130 [2024-11-16 12:12:15,594 INFO L226 Difference]: Without dead ends: 64 [2024-11-16 12:12:15,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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 12:12:15,598 INFO L432 NwaCegarLoop]: 93 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, 93 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 12:12:15,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:12:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-16 12:12:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-16 12:12:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 12:12:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-11-16 12:12:15,627 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 134 [2024-11-16 12:12:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:15,627 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-11-16 12:12:15,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 12:12:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-16 12:12:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 12:12:15,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:15,630 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:15,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:12:15,830 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 12:12:15,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:15,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:15,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2085910980, now seen corresponding path program 1 times [2024-11-16 12:12:15,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:12:15,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925947079] [2024-11-16 12:12:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:15,833 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 12:12:15,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:12:15,834 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 12:12:15,835 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 12:12:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:16,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 12:12:16,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:12:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 129 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-16 12:12:16,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:12:17,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:12:17,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925947079] [2024-11-16 12:12:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925947079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:12:17,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [430842718] [2024-11-16 12:12:17,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:17,038 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 12:12:17,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 12:12:17,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 12:12:17,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-16 12:12:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:17,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 12:12:17,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:12:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 129 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-16 12:12:18,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:12:18,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [430842718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:12:18,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:12:18,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-16 12:12:18,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556145230] [2024-11-16 12:12:18,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:12:18,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 12:12:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:12:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 12:12:18,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-16 12:12:18,241 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-16 12:12:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:12:19,057 INFO L93 Difference]: Finished difference Result 141 states and 196 transitions. [2024-11-16 12:12:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 12:12:19,063 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 136 [2024-11-16 12:12:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:12:19,064 INFO L225 Difference]: With dead ends: 141 [2024-11-16 12:12:19,065 INFO L226 Difference]: Without dead ends: 80 [2024-11-16 12:12:19,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2024-11-16 12:12:19,066 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:12:19,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 315 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:12:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-16 12:12:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-16 12:12:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 12:12:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2024-11-16 12:12:19,076 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 136 [2024-11-16 12:12:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:12:19,077 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2024-11-16 12:12:19,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-16 12:12:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2024-11-16 12:12:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 12:12:19,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:12:19,078 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:19,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-16 12:12:19,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 12:12:19,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:12:19,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:12:19,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:12:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash 278456517, now seen corresponding path program 1 times [2024-11-16 12:12:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:12:19,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689710425] [2024-11-16 12:12:19,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:12:19,481 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 12:12:19,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:12:19,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:12:19,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 12:12:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:12:19,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-16 12:12:19,667 INFO L278 TraceCheckSpWp]: Computing forward predicates...